Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points

DOI10.1016/0925-7721(95)00044-5zbMath0870.68148OpenAlexW2030545027MaRDI QIDQ676585

L. Paul Chew

Publication date: 18 March 1997

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00044-5

zbMATH Keywords

Voronoi diagram

Mathematics Subject Classification ID

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

Related Items (8)

A Laguerre Voronoi based scheme for meshing particle systems ⋮ On topological changes in the Delaunay triangulation of moving points ⋮ Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions ⋮ A simple and efficient kinetic spanner ⋮ On Kinetic Delaunay Triangulations ⋮ Ready, set, go! The Voronoi diagram of moving points that start from a line ⋮ The geometry of Minkowski spaces -- a survey. II. ⋮ Dynamic maintenance and visualization of molecular surfaces.

Cites Work

• A convex polygon among polygonal obstacle: Placement and high-clearance motion
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points