DocumentCode
568393
Title
Solving the Range Searching Problem for Region Bounded by a Convex Surface
Author
Tereshchenko, V. ; Socolov, O. ; Fisunenko, A.
fYear
2012
fDate
11-13 July 2012
Firstpage
491
Lastpage
494
Abstract
In this paper we consider one of the approaches to solving the range searching problem for a range which is bounded by a convex surface in Euclidean d-dimensional space. In particular, we propose a method of range searching which gives query time O(logN) and uses O(NlogN) memory where N is cardinality of an input data set. It is enabled by applying optimal data structures for storing points in nodes of a quadtree.
Keywords
computational complexity; computational geometry; data structures; search problems; set theory; Euclidean d-dimensional space; convex surface bounded region; data set cardinality; optimal data structures; point storage; quadtree nodes; query time; range searching problem; Approximation algorithms; Complexity theory; Data structures; Estimation; Hypercubes; Search problems; Vegetation; convex surface; ddimensional space; quadtree; range searching;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Visualisation (IV), 2012 16th International Conference on
Conference_Location
Montpellier
ISSN
1550-6037
Print_ISBN
978-1-4673-2260-7
Type
conf
DOI
10.1109/IV.2012.85
Filename
6295860
Link To Document