Ready, set, go! The Voronoi diagram of moving points that start from a line

DOI10.1016/j.ipl.2003.11.012zbMath1178.68612OpenAlexW1979460640MaRDI QIDQ1029088

Vladlen Koltun

Publication date: 9 July 2009

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

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

zbMATH Keywords

Voronoi diagramcomputational geometrynear-quadratic upper bound

Mathematics Subject Classification ID

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

Related Items (2)

Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations ⋮ On topological changes in the Delaunay triangulation of moving points

Cites Work

• Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points
• Some dynamic computational geometry problems
• Voronoi diagrams and arrangements
• Voronoi diagrams of rigidly moving sets of points
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• Queries on Voronoi diagrams on moving points
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• Data Structures for Mobile Data
• Voronoi Diagrams of Moving Points
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ready, set, go! The Voronoi diagram of moving points that start from a line