Sciweavers

208 search results - page 3 / 42
» Blocking delaunay triangulations
Sort
View
CPHYSICS
2004
93views more  CPHYSICS 2004»
13 years 7 months ago
Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
Gernot Schaller, Michael Meyer-Hermann
COMGEO
2007
ACM
13 years 7 months ago
Delaunay triangulations approximate anchor hulls
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...
Tamal K. Dey, Joachim Giesen, Samrat Goswami
AMC
2005
146views more  AMC 2005»
13 years 7 months ago
A functional language to implement the divide-and-conquer Delaunay triangulation algorithm
This paper investigates the implementation of a functional language algorithm for the divide-and-conquer Delaunay triangulation. The global aim is to improve its performance. Up t...
André L. Moura, José R. Camacho, Seb...
COMPGEOM
2008
ACM
13 years 9 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri