Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations

DOI10.1016/j.ipl.2004.08.004zbMath1173.68776OpenAlexW2079639821MaRDI QIDQ834956

L. Paul Chew, Klara Kedem, Amit Weisman

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.08.004

zbMATH Keywords

combinatorial problemscomputational geometryVoronoi diagrams

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Ready, set, go! The Voronoi diagram of moving points that start from a line
• Voronoi diagrams of rigidly moving sets of points
• Voronoi diagrams in higher dimensions under certain polyhedral distance functions
• Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions
• A lower bound on Voronoi diagram complexity.
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• 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

This page was built for publication: Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations