A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains (Q5120154)
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 L1 shortest path queries in polygonal domains |
scientific article; zbMATH DE number 7245480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains |
scientific article; zbMATH DE number 7245480 |
Statements
9 September 2020
0 references
A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains (English)
0 references
