The following pages link to Voronoi Diagrams of Moving Points (Q4513216):
Displaying 13 items.
- Shortest path problems on a polyhedral surface (Q472466) (← links)
- The Zermelo-Voronoi diagram: a dynamic partition problem (Q624956) (← links)
- Dynamical geometry for multiscale dissipative particle dynamics (Q709399) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- Ready, set, go! The Voronoi diagram of moving points that start from a line (Q1029088) (← links)
- Relay pursuit of a maneuvering target using dynamic Voronoi diagrams (Q1937505) (← links)
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation (Q2034245) (← links)
- Bisecting three classes of lines (Q2230403) (← links)
- A simple, faster method for kinetic proximity problems (Q2344057) (← links)
- Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space (Q2388506) (← links)
- Shortest Path Problems on a Polyhedral Surface (Q3183449) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
- A simple and efficient kinetic spanner (Q5902230) (← links)
