A divide-and-conquer algorithm for two-point \(L_1\) shortest path queries in polygonal domains (Q5088992)
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: A divide-and-conquer algorithm for two-point Lā shortest path queries in polygonal domains |
scientific article; zbMATH DE number 7559259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer algorithm for two-point \(L_1\) shortest path queries in polygonal domains |
scientific article; zbMATH DE number 7559259 |
Statements
18 July 2022
0 references
shortest paths
0 references
two-point queries
0 references
\(L_1\) metric
0 references
polygonal domains
0 references
0.9989983439445496
0 references
0.8612157702445984
0 references
0.8538784384727478
0 references
0.8484218120574951
0 references
0.8439434170722961
0 references
