Randomized Data Structures for the Dynamic Closest-Pair Problem (Q4210083)
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: Randomized Data Structures for the Dynamic Closest-Pair Problem |
scientific article; zbMATH DE number 1200715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized Data Structures for the Dynamic Closest-Pair Problem |
scientific article; zbMATH DE number 1200715 |
Statements
Randomized Data Structures for the Dynamic Closest-Pair Problem (English)
0 references
20 September 1998
0 references
computational geometry
0 references
proximity
0 references
dynamic data structures
0 references
randomization
0 references
0.9236394
0 references
0.9106509
0 references
0.9049878
0 references
0.9047451
0 references
0.9024417
0 references
