Kinetic data structures for all nearest neighbors and closest pair in the plane (Q5174471)
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 6405120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kinetic data structures for all nearest neighbors and closest pair in the plane |
scientific article; zbMATH DE number 6405120 |
Statements
Kinetic data structures for all nearest neighbors and closest pair in the plane (English)
0 references
17 February 2015
0 references
all nearest neighbors
0 references
closest pair
0 references
Delaunay triangulation
0 references
kinetic algorithm
0 references
Pie Delaunay graph
0 references
theta graph
0 references
0.97027344
0 references
0.8805288
0 references
0.86947185
0 references
0 references
0.86479247
0 references
0.86026746
0 references
0.8466128
0 references
0.8466128
0 references
