1888 search results - page 149 / 378 » Algorithms for Querying by Spatial Structure |
134
click to vote
GMP
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked li...
239
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Enabling keyword queries over relational databases (KQDB) benefits a large population of users who have difficulty in understanding the database schema or using SQLs. However, sin...
219
click to vote
COMPGEOM
2010
ACM
15 years 11 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 ...
174
click to vote
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
Efficient storage and retrieval of large multidimensional datasets is an important concernfor large-scale scientific computations such as long-running time-dependent simulations w...
154
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...