An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane

DOI10.1007/978-3-540-77120-3_58zbMath1193.68270OpenAlexW1534329287MaRDI QIDQ5387800

Jörg-Rüdiger Sack, Anil Maheshwari, Doron Nussbaum, Jiehua Yi

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_58

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On a Fire Fighter’s Problem

Cites Work

• Unnamed Item
• A sweepline algorithm for Euclidean Voronoi diagram of circles
• Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Shortest path amidst disc obstacles is computable
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane