Features of solving the range searching problems for d-dimensional case (Q2850360)
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: Features of solving the range searching problems for d-dimensional case |
scientific article; zbMATH DE number 6212534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Features of solving the range searching problems for d-dimensional case |
scientific article; zbMATH DE number 6212534 |
Statements
26 September 2013
0 references
range searching
0 references
d-dimensional space
0 references
tree
0 references
convex surface
0 references
Features of solving the range searching problems for d-dimensional case (English)
0 references
0.7794140577316284
0 references
0.7782562375068665
0 references
0.7669233083724976
0 references
