An O(n log n) Manhattan path algorithm (Q795510): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(84)90105-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004369220 / rank | |||
Normal rank | |||
Revision as of 00:32, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n) Manhattan path algorithm |
scientific article |
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
