An efficient search algorithm for minimum covering polygons on the sphere (Q2847730)
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: An efficient search algorithm for minimum covering polygons on the sphere |
scientific article; zbMATH DE number 6207539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient search algorithm for minimum covering polygons on the sphere |
scientific article; zbMATH DE number 6207539 |
Statements
11 September 2013
0 references
minimum covering spherical polygon
0 references
nearest neighbor search
0 references
modified \(kd\)-tree
0 references
unstructured grid
0 references
An efficient search algorithm for minimum covering polygons on the sphere (English)
0 references
0.7396328449249268
0 references
0.6953362226486206
0 references
0.691241979598999
0 references
0.6910465359687805
0 references
