Dog Bites Postman

DOI10.1142/S0218195998000163zbMath1035.68528OpenAlexW2168223208MaRDI QIDQ4513211

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

localisationrandomized algorithmsdynamic algorithmspost-office problem

Mathematics Subject Classification ID

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

Related Items (5)

An introduction to randomization in computational geometry ⋮ Sequential pursuit of multiple targets under external disturbances via Zermelo-Voronoi diagrams ⋮ Queries on Voronoi diagrams on moving points ⋮ Continuous-Time Moving Network Voronoi Diagram ⋮ FAST PURSUIT OF MOBILE NODES USING TPR TREES

Cites Work

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

This page was built for publication: Dog Bites Postman