Related papers: Linear-time geometric algorithm for evaluating B\'…
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…
We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, and enables the computation of braid monodromy not only…
A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with…
A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…
This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…
We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…
This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization…
Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image…
An extension to triangular domains of the univariate q-Bernstein basis functions is introduced and analyzed. Some recurrence relations and properties such as partition of unity and degree elevation are proved for them. It is also proved…
In this paper we present a method for direct evaluation of generalized B-splines (GB-splines) via the local representation of these curves as piecewise functions. To accomplish this we introduce a local structure that makes GB-spline curves…
We present a new algorithm for computing hyperexponential solutions of ordinary linear differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic…
Farin proposed a method for designing Bezier curves with monotonic curvature and torsion. Such curves are relevant in design due to their aesthetic shape. The method relies on applying a matrix M to the first edge of the control polygon of…
In this paper, we give an elementary new method for determining the rational points on algebraic curves using torsion packets. We also provide examples of curves for which all rational points can be completely determined by our method.
In this paper we present an algorithm to compute the (real and complex) straight lines contained in a rational surface, defined by a rational parameterization. The algorithm relies on the well-known theorem of Differential Geometry that…
A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a…
We present a novel algorithm attaining excessively fast, the sought solution of linear systems of equations. The algorithm is short in its basic formulation and, by definition, vectorized, while the memory allocation demands are trivial,…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
Using the normalized B-bases of vector spaces of trigonometric and hyperbolic polynomials of finite order, we specify control point configurations for the exact description of higher dimensional (rational) curves and (hybrid) multivariate…
We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on…