Shortest paths for disc obstacles

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

Research output: Contribution to journalArticle

Abstract

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)
Volume3045
StatePublished - 2004

Fingerprint

Shortest path
Filter
Geodesic
Dijkstra Algorithm
Ellipse
Convex Hull
Search Space
Disjoint
Filtering
Radius
Computing

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Shortest paths for disc obstacles. / Kim, Deok Soo; Yu, Kwangseok; Cho, Youngsong; Kim, Donguk; Yap, Chee.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3045, 2004, p. 62-70.

Research output: Contribution to journalArticle

@article{3bc14a6442354158b7cd10902c360b22,
title = "Shortest paths for disc obstacles",
abstract = "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.",
keywords = "Convex hull, Dijkstra, Disc obstacles, Ellipse, Geodesic, Voronoi diagram",
author = "Kim, {Deok Soo} and Kwangseok Yu and Youngsong Cho and Donguk Kim and Chee Yap",
year = "2004",
language = "English (US)",
volume = "3045",
pages = "62--70",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Shortest paths for disc obstacles

AU - Kim, Deok Soo

AU - Yu, Kwangseok

AU - Cho, Youngsong

AU - Kim, Donguk

AU - Yap, Chee

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Convex hull

KW - Dijkstra

KW - Disc obstacles

KW - Ellipse

KW - Geodesic

KW - Voronoi diagram

UR - http://www.scopus.com/inward/record.url?scp=31344457577&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=31344457577&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:31344457577

VL - 3045

SP - 62

EP - 70

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -