1888 search results - page 136 / 378 » Algorithms for Querying by Spatial Structure |
191
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
166
click to vote
CCCG
2010
15 years 7 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
203
click to vote
ICST
2010
IEEE
15 years 4 months ago
2010
IEEE
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
175
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
168
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribu...