An O(n log n) Manhattan path algorithm (Q795510)
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: An O(n log n) Manhattan path algorithm |
scientific article; zbMATH DE number 3862457
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n) Manhattan path algorithm |
scientific article; zbMATH DE number 3862457 |
Statements
An O(n log n) Manhattan path algorithm (English)
0 references
1984
0 references
computational geometry
0 references
shortest paths
0 references
segments on the plane
0 references
Manhattan path
0 references
