Queries on Voronoi diagrams on moving points

DOI10.1016/0925-7721(95)00053-4zbMath0857.68104OpenAlexW2012386415MaRDI QIDQ1924716

Klara Kedem, Mordecai J. Golin, Olivier Devillers, Stefan Schirra

Publication date: 3 March 1997

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

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

zbMATH Keywords

Voronoi diagramparametric searchdynamic computational geometrypost-office problempersistent data structures

Mathematics Subject Classification ID

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

Related Items (8)

Shortest Path Problems on a Polyhedral Surface ⋮ Indexing moving points ⋮ Relay pursuit of a maneuvering target using dynamic Voronoi diagrams ⋮ Lagrangian Voronoï meshes and particle dynamics with shocks ⋮ The Zermelo-Voronoi diagram: a dynamic partition problem ⋮ Computational analysis of cutting parameters based on gradient Voronoi model of cancellous bone ⋮ Shortest path problems on a polyhedral surface ⋮ Ready, set, go! The Voronoi diagram of moving points that start from a line

Cites Work

• Making data structures persistent
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Voronoi diagrams over dynamic scenes
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• Searching and storing similar lists
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• VORONOI DIAGRAMS IN A RIVER
• Dog Bites Postman
• Voronoi diagrams of moving points in higher dimensional spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Queries on Voronoi diagrams on moving points