The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains

DOI10.1007/978-3-540-87744-8_9zbMath1158.68523OpenAlexW1759300519MaRDI QIDQ3541078

Shripad Thite, Boris Aronov, Mark T. de Berg

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_9

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Higher-order Voronoi diagrams on triangulated surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds on the union complexity of fat objects
• The complexity of the free space for motion planning amidst fat obstacles
• Realistic input models for geometric algorithms
• The Discrete Geodesic Problem
• Shortest paths on realistic polyhedra
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS

This page was built for publication: The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains