Sciweavers

Share
SGP
2007

Delaunay mesh construction

8 years 7 months ago
Delaunay mesh construction
We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometrypreserving refinement and prove their correctness. In particular we show that edge flipping serves to reduce mesh surface area, and that a poorly sampled input mesh may yield unflippable edges necessitating refinement to ensure a Delaunay mesh output. Multiresolution Delaunay meshes can be obtained via constrained mesh decimation. We further examine the usefulness of trading off the geometry-preserving feature of our algorithm with the ability to create fewer triangles. We demonstrate the performance of our algorithms through several experiments. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Curve, surface, solid and object representations
Ramsay Dyer, Hao Zhang 0002, Torsten Möller
Added 30 Sep 2010
Updated 30 Sep 2010
Type Conference
Year 2007
Where SGP
Authors Ramsay Dyer, Hao Zhang 0002, Torsten Möller
Comments (0)
books