Voronoi Diagrams for Parallel Halflines and Line Segments in Space

DOI10.4230/LIPIcs.ISAAC.2017.7zbMath1457.68276OpenAlexW2782907315MaRDI QIDQ5136222

Bert Jüttler, Franz Aurenhammer, Günter Paulini

Publication date: 25 November 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8215/pdf/LIPIcs-ISAAC-2017-7.pdf/

zbMATH Keywords

Voronoi diagramline segmentsspace-sweep algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Computing the topology of Voronoï diagrams of parallel half-lines

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• The Voronoi diagram of three lines
• Geometric relations among Voronoi diagrams
• Almost tight upper bounds for lower envelopes in higher dimensions
• Polyhedral Voronoi diagrams of polyhedra in three dimensions
• A lower bound on Voronoi diagram complexity.
• On the two-dimensional Davenport-Schinzel problem
• Voronoi Diagrams and Delaunay Triangulations
• Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics
• Bisectors and Voronoï Diagram of a Family of Parallel Half-Lines
• Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
• 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
• Power Diagrams: Properties, Algorithms and Applications

This page was built for publication: Voronoi Diagrams for Parallel Halflines and Line Segments in Space