Generating textures on arbitrary surfaces using reaction-diffusion
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
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
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
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
Delaunay refinement mesh generation
Delaunay refinement mesh generation
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Surface sampling and the intrinsic Voronoi diagram
SGP '08 Proceedings of the Symposium on Geometry Processing
Isotropic Surface Remeshing Using Constrained Centroidal Delaunay Mesh
Computer Graphics Forum
| Hi-index | 0.00 |
We define a Delaunay mesh to be a manifold triangle mesh whose edges form an intrinsic Delaunay triangulation or iDT of its vertices, where the triangulated domain is the piecewise flat mesh surface. We show that meshes constructed from a smooth surface by taking an iDT or a restricted Delaunay triangulation, do not in general yield a Delaunay mesh. We establish a precise dual relationship between the iDT and the Voronoi tessellation of the vertices of a piecewise flat (pwf) surface and exploit this duality to demonstrate criteria which ensure the existence of a proper Delaunay triangulation.