286 search results - page 29 / 58 » Proximality and Chebyshev sets |
BVAI
2005
Springer
14 years 3 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
COMPGEOM
1997
ACM
14 years 2 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
CCCG
2006
13 years 11 months ago
2006
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
DAGSTUHL
2003
13 years 11 months ago
2003
Abstract Multiresolution models support the interactive visualization of large volumetric data through selective refinement, an operation which permits to focus resolution only on...
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 ...