Voronoi diagrams of moving points in higher dimensional spaces
From MaRDI portal
Publication:5056158
DOI10.1007/3-540-55706-7_36zbMath1504.68242OpenAlexW1532020578MaRDI QIDQ5056158
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_36
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Queries on Voronoi diagrams on moving points ⋮ Maintaining proximity in higher dimensional spaces ⋮ The active selfish herd ⋮ Voronoi diagrams of random lines and flats ⋮ Dynamic maintenance and visualization of molecular surfaces.
Cites Work
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Some dynamic computational geometry problems
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item