An O(n2log n) time algorithm for computing shortest paths amidst growing discs in the plane

Authors:
Anil Maheshwari;Doron Nussbaum;Jörg-Rüdiger Sack;Jiehua Yi
Affiliations:
Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada;Carleton University, Ottawa, ON, Canada
Venue:
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Year:
2007

Citing 2
Cited 0

Shortest path amidst disc obstacles is computable

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A sweepline algorithm for Euclidean Voronoi diagram of circles

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm to compute a shortest path for a robot between two points that avoids n discs growing at a common speed in the plane. Our algorithm runs in O(n2 log n) time, thus improving upon the best previous solution by a factor of n. The complexity for the growing disc problem matches the known bound for the more restricted case when the discs are static.