\(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01758836 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063372577 / rank | |||
Normal rank |
Latest revision as of 11:17, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(L_ 1\) shortest paths among polygonal obstacles in the plane |
scientific article |
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