Towards space efficient two-point shortest path queries in a polygonal domain (Q6895889)
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 8125628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards space efficient two-point shortest path queries in a polygonal domain |
scientific article; zbMATH DE number 8125628 |
Statements
Towards space efficient two-point shortest path queries in a polygonal domain (English)
0 references
24 November 2025
0 references
data structure
0 references
polygonal domain
0 references
geodesic distance
0 references
0 references
0 references
