Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179)
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: Computing an \(L_1\) shortest path among splinegonal obstacles in the plane |
scientific article; zbMATH DE number 7595907
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing an \(L_1\) shortest path among splinegonal obstacles in the plane |
scientific article; zbMATH DE number 7595907 |
Statements
Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (English)
0 references
4 October 2022
0 references
computational geometry
0 references
shortest paths
0 references
splinegon obstacles
0 references
0 references
0 references
