Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Triangulating topological spaces
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Properties of the Delaunay triangulation
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Surface reconstruction by Voronoi filtering
Proceedings of the fourteenth annual symposium on Computational geometry
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
Proceedings of the sixteenth annual symposium on Computational geometry
Optimizing 3D triangulations using discrete curvature analysis
Mathematical Methods for Curves and Surfaces
Object-oriented software for quadratic programming
ACM Transactions on Mathematical Software (TOMS)
Provably good surface sampling and approximation
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Delaunay refinement mesh generation
Delaunay refinement mesh generation
Sampling and meshing a surface with guaranteed topology and geometry
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Learning smooth objects by probing
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Geometry and Topology for Mesh Generation (Cambridge Monographs on Applied and Computational Mathematics)
Voronoi-Delaunay duality and Delaunay meshes
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Nonobtuse remeshing and mesh decimation
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
A Discrete Laplace–Beltrami Operator for Simplicial Surfaces
Discrete & Computational Geometry
Geometric accuracy analysis for discrete surface approximation
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Geodesic Delaunay triangulation and witness complex in the plane
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Technical Section: Variational implicit surface meshing
Computers and Graphics
Gabriel meshes and Delaunay edge flips
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Progressive lossless mesh compression via incremental parametric refinement
SGP '09 Proceedings of the Symposium on Geometry Processing
Geodesic delaunay triangulations in bounded planar domains
ACM Transactions on Algorithms (TALG)
ACM SIGGRAPH 2010 Courses
A mobile-oriented hand segmentation algorithm based on fuzzy multiscale aggregation
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
SMI 2011: Full Paper: Point set silhouettes via local reconstruction
Computers and Graphics
Robust modeling of constant mean curvature surfaces
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Applications of Geometry Processing: Blue noise sampling of surfaces
Computers and Graphics
Isotropic Surface Remeshing Using Constrained Centroidal Delaunay Mesh
Computer Graphics Forum
| Hi-index | 0.00 |
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.