Voronoi Diagrams of Moving Points
DOI10.1142/S0218195998000187zbMATH Open1035.68520OpenAlexW2145517001MaRDI QIDQ4513216FDOQ4513216
Authors: Gerhard Albers, Joseph S. B. Mitchell, Thomas Roos, Leonidas Guibas 
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195998000187
Recommendations
dynamic computational geometryDavenport-Schinzel sequencesDelaunay diagramskinematic data structures
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- An optimal convex hull algorithm in any fixed dimension
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Voronoi diagrams from convex hulls
- Some dynamic computational geometry problems
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- On the complexity of d-dimensional Voronoi diagrams
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
- Voronoi diagrams over dynamic scenes
Cited In (23)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ready, set, go! The Voronoi diagram of moving points that start from a line
- Voronoi diagrams of rigidly moving sets of points
- Bisecting three classes of lines
- Title not available (Why is that?)
- Approximation algorithm for the kinetic robust \(k\)-center problem
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
- A simple and efficient kinetic spanner
- Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space
- A simple, faster method for kinetic proximity problems
- Shortest Path Problems on a Polyhedral Surface
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation
- Maintaining proximity in higher dimensional spaces (extended abstract)
- Title not available (Why is that?)
- Dynamical geometry for multiscale dissipative particle dynamics
- The Zermelo-Voronoi diagram: a dynamic partition problem
- Shortest path problems on a polyhedral surface
- Relay pursuit of a maneuvering target using dynamic Voronoi diagrams
- Voronoi diagrams of moving points in higher dimensional spaces
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
- Title not available (Why is that?)
This page was built for publication: Voronoi Diagrams of Moving Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513216)
