36 search results - page 2 / 8 » Space-efficient approximate Voronoi diagrams |
CCCG
2006
13 years 9 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...
CGF
2004
13 years 7 months ago
2004
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
STOC
2002
ACM
14 years 8 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...
URBAN
2008
13 years 7 months ago
2008
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding qu...