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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9284700751304626
0 references
0.8150022625923157
0 references
0.8080726861953735
0 references
0.7819316983222961
0 references
0.7813464403152466
0 references
