The Voronoi diagram of three lines
From MaRDI portal
Publication:1028584
DOI10.1007/s00454-009-9173-3zbMath1194.68247OpenAlexW4241955075MaRDI QIDQ1028584
Mohab Safey El Din, Daniel Lazard, Sylvain Lazard, Hazel Everett
Publication date: 6 July 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9173-3
Related Items
Computing real radicals and \(S\)-radicals of polynomial systems ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ Voronoi Diagrams for Parallel Halflines and Line Segments in Space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- On the computation of an arrangement of quadrics in 3D
- Common tangents to spheres in \(\mathbb R^{3}\)
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
- Near-optimal parameterization of the intersection of quadrics. II. A classification of pencils
- Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections
- Every planar map is four colorable. I: Discharging
- Almost tight upper bounds for lower envelopes in higher dimensions
- The four-colour theorem
- Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces
- Triangulations in CGAL
- Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic. I: Representations
- Semialgebraic Sard theorem for generalized critical values.
- Interval arithmetic in cylindrical algebraic decomposition
- Testing sign conditions on a multivariate polynomial and applications
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
- Minimum-weight triangulation is NP-hard
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- THE PREDICATES FOR THE EXACT VORONOI DIAGRAM OF ELLIPSES UNDER THE EUCLIDIEAN METRIC
- A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
- On the discriminant of real symmetric matrices
- Using Algebraic Geometry
- 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
- Machine Proofs in Geometry
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
- On the topology of planar algebraic curves
- Planning Algorithms
- FGb: A Library for Computing Gröbner Bases
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- Computing Voronoi skeletons of a 3-D polyhedron by space subdivision
This page was built for publication: The Voronoi diagram of three lines
