1233 search results - page 50 / 247 » Extensible Point Location Algorithm |
SSD
1993
Springer
15 years 1 months ago
1993
Springer
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...
COMPGEOM
2005
ACM
14 years 11 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...
CCCG
2010
14 years 11 months ago
2010
Consider an arrangement of equilateral non-overlapping translated triangles in the plane and two points S and T so that the segment ST is parallel to a side of each of the triangl...
198
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...