33 search results - page 6 / 7 » Shortest Path Queries Between Geometric Objects on Surfaces |
VR
2003
IEEE
14 years 19 days ago
2003
IEEE
This paper presents a real-time database modeling complex networks of intersecting roads and walkways in urban virtual environments. The database represents information about the ...
SMA
2006
ACM
14 years 1 months ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
PAMI
2006
13 years 7 months ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
VLDB
2004
ACM
14 years 22 days ago
2004
ACM
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...