An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs (Q2678259)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7639685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs |
scientific article; zbMATH DE number 7639685 |
Statements
An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs (English)
0 references
9 January 2023
0 references
unit-disk graphs
0 references
shortest paths
0 references
L1 metric
0 references
Voronoi diagrams
0 references
0 references
0.8708760142326355
0 references
0.8549715280532837
0 references
0.8287818431854248
0 references
0.8272877335548401
0 references
