Dog Bites Postman

DOI10.1142/S0218195998000163MaRDI QIDQ4513211zbMATH OpenOpenAlexFDO

Authors Olivier Devillers, Mordecai J. Golin

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/s0218195998000163

zbMATH Keywords

dynamic algorithmslocalisationpost-office problemrandomized algorithms

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Recommendations

• Queries on Voronoi diagrams on moving points
• scientific article; zbMATH DE number 108318
• Point location in the continuous-time moving network
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• scientific article; zbMATH DE number 4213492

Cites work

• Applications of random sampling in computational geometry. II
• Applications of random sampling to on-line algorithms in computational geometry
• Four results on randomized incremental constructions
• Fully dynamic Delaunay triangulation in logarithmic expected per operation
• On the randomized construction of the Delaunay tree
• Optimal Point Location in a Monotone Subdivision
• PLANAR POINT LOCATION REVISITED
• RANDOMIZATION YIELDS SIMPLE O(n log^⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
• Randomized incremental construction of Delaunay and Voronoi diagrams
• VORONOI DIAGRAMS IN A RIVER

Cited in

(5)

• An introduction to randomization in computational geometry
• Queries on Voronoi diagrams on moving points
• Sequential pursuit of multiple targets under external disturbances via Zermelo-Voronoi diagrams
• Continuous-time moving network Voronoi diagram
• FAST PURSUIT OF MOBILE NODES USING TPR TREES

This page was built for publication: Dog Bites Postman

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513211)