49 search results - page 8 / 10 » Computability of Partial Delaunay Triangulation and Voronoi ... |
122
click to vote
SMA
2009
ACM
15 years 5 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
CGF
2004
14 years 10 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...
FOCS
2007
IEEE
15 years 2 months ago
2007
IEEE
We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a 1-parameter family...
CAD
2005
Springer
14 years 10 months ago
2005
Springer
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
GD
2006
Springer
15 years 2 months ago
2006
Springer
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become ...