Randomized incremental construction of abstract Voronoi diagrams
Computational Geometry: Theory and Applications
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
A sum of squares theorem for visibility
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
An algebraic condition for the separation of two ellipsoids
Computer Aided Geometric Design
Voronoi diagram of a circle set from Voronoi diagram of a point set: geometry
Computer Aided Geometric Design
On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
Discrete & Computational Geometry
Voronoi diagrams of semi-algebraic sets
Voronoi diagrams of semi-algebraic sets
Precise Voronoi cell extraction of free-form rational planar closed curves
Proceedings of the 2005 ACM symposium on Solid and physical modeling
The Voronoi Diagram of Curved Objects
Discrete & Computational Geometry
The predicates of the Apollonius diagram: algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
A new approach to characterizing the relative position of two ellipses depending on one parameter
Computer Aided Geometric Design
Convex hull and voronoi diagram of additively weighted points
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Real solving of bivariate polynomial systems
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Univariate polynomial real root isolation: continued fractions revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the complexity of real root isolation using continued fractions
Theoretical Computer Science
Computing the Voronoi cells of planes, spheres and cylinders in R3
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
Real algebraic numbers and polynomial systems of small degree
Theoretical Computer Science
Divide-and-conquer for Voronoi diagrams revisited
Proceedings of the twenty-fifth annual symposium on Computational geometry
Computing the Voronoi cells of planes, spheres and cylinders in R3
Computer Aided Geometric Design
Divide-and-conquer for Voronoi diagrams revisited
Computational Geometry: Theory and Applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
| Hi-index | 0.00 |
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation paradigm, for the predicates of an incremental algorithm: κ1 decides which one of 2 given ellipses is closest to a given exterior point; κ2 decides the position of a query ellipse relative to an external bitangent line of 2 given ellipses; κ3 decides the position of a query ellipse relative to a Voronoi circle of 3 given ellipses; κ4 determines the type of conflict between a Voronoi edge, defined by 4 given ellipses, and a query ellipse. The paper is restricted to non-intersecting ellipses, but the extension to arbitrary ones is possible.The ellipses are input in parametric representation or constructively in terms of their axes, center and rotation. For κ1 and κ2 we derive optimal algebraic conditions, solve them exactly and provide efficient implementations in C++. For κ3 we compute a tight bound on the number of complex tritangent circles and use the parametric form of the ellipses in order to design an exact subdivision-based algorithm, which is implemented on Maple. This approach essentially answers κ4 as well. We conclude with current work on optimizing κ3 and implementing it in C++.