Delaunay mesh generation governed by metric specifications. Part I algorithms
Finite Elements in Analysis and Design
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Generating well-shaped Delaunay meshed in 3D
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
Proceedings of the nineteenth annual symposium on Computational geometry
Sliver-free three dimensional delaunay mesh generation
Sliver-free three dimensional delaunay mesh generation
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Anisotropic diagrams: Labelle Shewchuk approach revisited
Theoretical Computer Science
From Segmented Images to Good Quality Meshes Using Delaunay Refinement
Emerging Trends in Visual Computing
Manifold reconstruction using tangential Delaunay complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Obtuse triangle suppression in anisotropic meshes
Computer Aided Geometric Design
Duals of orphan-free anisotropic voronoi diagrams are embedded meshes
Proceedings of the twenty-eighth annual symposium on Computational geometry
Particle-based anisotropic surface meshing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.00 |
Various definitions of so called anisotropic Voronoi diagrams have been proposed. These diagrams are typically parameterized by a metric field. Under mild hypotheses on the metric field, such Voronoi diagrams can be refined so that their dual is a triangulation, with elements shaped according to the specified anisotropic metric field. We propose an alternative approach to anisotropic mesh generation, relying on the notion of locally uniform anisotropic mesh. A locally uniform anisotropic mesh is a mesh such that the star around each vertex v coincides with the star that v would have if the metric on the domain was uniform and equal to the metric at v. This definition allows to define a simple refinement algorithm which relies on elementary predicates, and provides, after completion, an anisotropic mesh in dimensions 2 and 3. A practical implementation has been done in the 2D case.