Related papers: Linear-time geometric algorithm for evaluating B\'…
In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DLP) into a system of equations. These…
Properties of a parametric curve in R^3 are often determined by analysis of its piecewise linear (PL) approximation. For Bezier curves, there are standard algorithms, known as subdivision, that recursively create PL curves that converge to…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new…
This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
We present an algorithm for computing the set of torsion points satisfying a given system of multivariate polynomial equations. Its complexity is quasilinear in the logarithm of the degree of the input equations and exponential in their…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
A comparison of a new algorithm for line clipping in E2 and E3 by convex polygon and/or polyhedron with O(1) processing complexity and Cyrus- Beck algorithm is presented. The new algorithm in E2 is based on dual space representation and…
We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
In this work, we develop a framework based on piecewize B\'ezier curves to plane shapes deformation and we apply it to shape optimization problems. We describe a general setting and some general result to reduce the study of a shape…
We present an improved algorithm for computing the $4$-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and it is simple to describe and to implement in the pointer…
We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…
The aim of this paper is to prove a uniform Fourier restriction estimate for certain $2-$dimensional surfaces in $\mathbb R^{2n}$. These surfaces are the image of complex polynomial curves $\gamma(z) = (p_1(z), \dots, p_n(z))$, equipped…
A technique is described for constructing three-dimensional vector graphics representations of planar regions bounded by cubic B\'ezier curves, such as smooth glyphs. It relies on a novel algorithm for compactly partitioning planar B\'ezier…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
A method is proposed for constructing a spline curve of the Bezier type, which is continuous along with its first derivative by a piecewise polynomial function. Conditions for its existence and uniqueness are given. The constructed curve…
In this paper, we give an efficient algorithm of degree reduction of B\'ezier curves with box constraints. The idea is to combine the previous iterative approach, that has been presented recently in (P. Gospodarczyk, Comput. Aided Des. 62…
We present a new approach to the problem of $G^{k,l}$-constrained ($k,l \leq 3$) multi-degree reduction of B\'{e}zier curves with respect to the least squares norm. First, to minimize the least squares error, we consider two methods of…