Delaunay mesh generation governed by metric specifications. Part I algorithms
Finite Elements in Analysis and Design
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
Proceedings of the nineteenth annual symposium on Computational geometry
A new methodology for anisotropic mesh refinement based upon error gradients
Applied Numerical Mathematics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Locally uniform anisotropic meshing
Proceedings of the twenty-fourth annual symposium on Computational geometry
From Segmented Images to Good Quality Meshes Using Delaunay Refinement
Emerging Trends in Visual Computing
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Particle-based anisotropic surface meshing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Optimal partitioning for multi-vehicle systems using quadratic performance criteria
Automatica (Journal of IFAC)
| Hi-index | 5.23 |
F. Labelle and J. Shewchuk have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized 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 view of the construction of these diagrams, and a variant of Labelle and Shewchuk's meshing algorithm. This variant computes the Voronoi vertices, using a higher dimensional power diagram and refines the diagram as long as dual triangles overlap. We see this variant as a first step toward a 3-dimensional anisotropic meshing algorithm.