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...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
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...
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...
Paul Bendich, David Cohen-Steiner, Herbert Edelsbr...
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...
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 ...