Improved dynamic geodesic nearest neighbor searching in a simple polygon (Q5115770)
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: Improved dynamic geodesic nearest neighbor searching in a simple polygon |
scientific article; zbMATH DE number 7236408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved dynamic geodesic nearest neighbor searching in a simple polygon |
scientific article; zbMATH DE number 7236408 |
Statements
18 August 2020
0 references
data structure
0 references
simple polygon
0 references
geodesic distance
0 references
nearest neighbor searching
0 references
shallow cutting
0 references
0 references
0 references
0 references
0.8029837608337402
0 references
0.7993595600128174
0 references
0.7934728264808655
0 references
0.7912460565567017
0 references
