1689 search results - page 20 / 338 » Proximate point searching |
ICMI
2007
Springer
14 years 3 months ago
2007
Springer
The rapid development of large interactive wall displays has been accompanied by research on methods that allow people to interact with the display at a distance. The basic method...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
CCCG
2006
13 years 11 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
TIT
2002
13 years 9 months ago
2002
In this semitutorial paper, a comprehensive survey of closest point search methods for lattices without a regular structure is presented. The existing search strategies are describ...
SIGMOD
2000
ACM
14 years 2 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...