Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing \(L_1\) shortest paths among polygonal obstacles in the plane |
scientific article |
Statements
Computing \(L_1\) shortest paths among polygonal obstacles in the plane (English)
0 references
17 May 2019
0 references
shortest paths
0 references
polygonal domains
0 references
L1 metric
0 references
Voronoi diagrams
0 references
computational geometry
0 references
algorithms
0 references
data structures
0 references
0 references
0 references
0 references
