Shortest paths for disc obstacles

Deok Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee Yap

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)62-70
Number of pages9
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
StatePublished - Dec 1 2004


  • Convex hull
  • Dijkstra
  • Disc obstacles
  • Ellipse
  • Geodesic
  • Voronoi diagram

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Shortest paths for disc obstacles'. Together they form a unique fingerprint.

Cite this