\(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116)
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: \(L_ 1\) shortest paths among polygonal obstacles in the plane |
scientific article; zbMATH DE number 40096
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(L_ 1\) shortest paths among polygonal obstacles in the plane |
scientific article; zbMATH DE number 40096 |
Statements
\(L_ 1\) shortest paths among polygonal obstacles in the plane (English)
0 references
13 August 1992
0 references
rectilinear paths
0 references
wire routing
0 references
continuous Dijkstra algorithm
0 references
fixed orientation metrics
0 references
Voronoi diagram
0 references
0 references
