Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams

DOI10.1137/17M1152292zbMath1427.68331arXiv1703.06487WikidataQ115246934 ScholiaQ115246934MaRDI QIDQ5232320

Mael Rouxel-Labbé, M. H. M. J. Wintraecken, Jean-Daniel Boissonnat

Publication date: 2 September 2019

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.06487

zbMATH Keywords

Riemannian geometryVoronoi diagramDelaunay triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

The topological correctness of PL approximations of isomanifolds ⋮ Design of 3D anisotropic Voronoi porous structure driven by stress field

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orphan-free anisotropic Voronoi diagrams
• Riemannian simplices and triangulations
• Triangulations from topologically correct digital Voronoi diagrams
• Only distances are required to reconstruct submanifolds
• Delaunay triangulation of manifolds
• Graph induced complex on point data
• Finding the homology of submanifolds with high confidence from random samples
• Duals of orphan-free anisotropic voronoi diagrams are embedded meshes
• Geodesic Methods in Computer Vision and Graphics
• On Optimal Interpolation Triangle Incidences
• Anisotropic surface meshing
• Riemannian center of mass and mollifier smoothing
• Anisotropic Centroidal Voronoi Tessellations and Their Applications
• Local criteria for triangulation of manifolds
• The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.
• Anisotropic Delaunay Mesh Generation
• Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
• Introduction to matrix analysis and applications
• Optimal meshes for finite elements of arbitrary order

This page was built for publication: Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams