84 search results - page 3 / 17 » Clustering Uncertain Data Using Voronoi Diagrams |
STOC
2002
ACM
15 years 9 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
CCCG
2006
14 years 10 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...
100
click to vote
ICNP
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract—In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
JMIV
2006
14 years 9 months ago
2006
Centroidal Voronoi tessellations (CVT's) are special Voronoi tessellations for which the generators of the tessellation are also the centers of mass (or means) of the Voronoi ...