Approximate range searching using binary space partitions (Q2489539)
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 5020726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate range searching using binary space partitions |
scientific article; zbMATH DE number 5020726 |
Statements
Approximate range searching using binary space partitions (English)
0 references
28 April 2006
0 references
Geometric data structures
0 references
Approximate range searching
0 references
Binary space partitions
0 references
Realistic input models
0 references
0.9974980354309082
0 references
0.8073063492774963
0 references
0.7936480641365051
0 references
0.7936480641365051
0 references
0.7657593488693237
0 references
