49 search results - page 1 / 10 » Computability of Partial Delaunay Triangulation and Voronoi ... |
ENTCS
2002
14 years 10 months ago
2002
100
click to vote
COMGEO
2007
ACM
14 years 10 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...
ESA
2001
Springer
15 years 3 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
CCCG
2008
15 years 5 days ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
103
click to vote
CCCG
2003
15 years 3 days ago
2003
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed ...