Sciweavers

208 search results - page 6 / 42
» Blocking delaunay triangulations
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
CCCG
2009
13 years 8 months ago
On the Dilation of Delaunay Triangulations of Points in Convex Position
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
Shiliang Cui, Iyad A. Kanj, Ge Xia
COMPGEOM
2000
ACM
13 years 11 months ago
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Eu...
Greg Leibon, David Letscher
CVPR
2007
IEEE
14 years 9 months ago
Delaunay Deformable Models: Topology-Adaptive Meshes Based on the Restricted Delaunay Triangulation
In this paper, we propose a robust and efficient Lagrangian approach, which we call Delaunay Deformable Models, for modeling moving surfaces undergoing large deformations and topo...
Jean-Philippe Pons, Jean-Daniel Boissonnat
WADS
2001
Springer
105views Algorithms» more  WADS 2001»
13 years 11 months ago
Voronoi Diagrams for Moving Disks and Applications
In this paper we discuss the kinetic maintenance of the Euclidean Voronoi diagram and its dual, the Delaunay triangulation, for a set of moving disks. The most important aspect in ...
Menelaos I. Karavelas