Given a number of obstacles in a plane, the problem of computing a geodesic (or the shortest path) between two points has been studied extensively. However, the case where the obstacles are circular discs has not been explored as much as it deserves. In this paper, we present an algorithm to compute a geodesic among a set of mutually disjoint discs, where the discs can have different radii. We devise two filters, an ellipse filter and a convex hull filter, which can significantly reduce the search space. After filtering, we apply Dijkstra's algorithm to the remaining discs. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Kim, D. S., Yu, K., Cho, Y., Kim, D., & Yap, C. (2004). Shortest paths for disc obstacles. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3045, 62–70. https://doi.org/10.1007/978-3-540-24767-8_7
Mendeley helps you to discover research relevant for your work.