Planar rectilinear shortest path computation using corridors (Q833714)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Planar rectilinear shortest path computation using corridors |
scientific article; zbMATH DE number 5595373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar rectilinear shortest path computation using corridors |
scientific article; zbMATH DE number 5595373 |
Statements
Planar rectilinear shortest path computation using corridors (English)
0 references
14 August 2009
0 references
The authors study the problem of finding a 2-dimensional rectilinear (\(L_1\)) shortest path between two points in a polygonal region comprising non-intersecting polygonal obstacles. They propose an algorithm that builds a restricted visibility graph and then applies Dijkstra's shortest path algorithm on this visibility graph [cf. \textit{J. Hershberger} and \textit{S. Suri}, SIAM J. Comput. 28, No.~6, 2215--2256 (1999; Zbl 0939.68157)]. A shorter version of the paper appeared in [Lecture Notes in Computer Science 4855, 412--423 (2007; Zbl 1135.68600)].
0 references
shortest path computation
0 references
polygonal regions
0 references
polygonal obstacles
0 references
algorithm
0 references
visibility graph
0 references
0 references
0 references
0.9299126863479614
0 references
0.8623378276824951
0 references
0.8476885557174683
0 references
0.8439422249794006
0 references
0.8362186551094055
0 references
