230 search results - page 2 / 46 » Data Structures for Restricted Triangular Range Searching |
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
WEBDB
2007
Springer
13 years 11 months ago
2007
Springer
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restric...
3DPVT
2004
IEEE
13 years 9 months ago
2004
IEEE
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...