Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q833707 |
Changed an Item |
||
| Property / author | |||
| Property / author: Rajasekhar Inkulu / rank | |||
Normal rank | |||
Revision as of 12:53, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing an \(L_1\) shortest path among splinegonal obstacles in the plane |
scientific article |
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
