Anisotropic triangulations via discrete Riemannian Voronoi diagrams

Jean-Daniel Boissonnat 1 Mael Rouxel-Labbé 1, 2 Mathijs Wintraecken 1
1 DATASHAPE - Understanding the Shape of Data
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Rieman-nian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This structure has been implemented and was shown to lead to good triangulations in R 2 and on surfaces embedded in R 3 as detailed in our experimental companion paper. In this paper, we study theoretical aspects of our structure. Given a finite set of points P in a domain Ω equipped with a Riemannian metric, we compare the discrete Riemannian Voronoi diagram of P to its Riemannian Voronoi diagram. Both diagrams have dual structures called the discrete Riemannian Delaunay and the Riemannian Delaunay complex. We provide conditions that guarantee that these dual structures are identical. It then follows from previous results that the discrete Riemannian Delaunay complex can be embedded in Ω under sufficient conditions, leading to an anisotropic triangulation with curved simplices. Furthermore, we show that, under similar conditions, the simplices of this triangulation can be straightened. 1998 ACM Subject Classification Computational Geometry and Object Modeling 1 Introduction Anisotropic triangulations are triangulations whose elements are elongated along prescribed directions. Anisotropic triangulations are known to be well suited when solving PDE's [10, 19, 24]. They can also significantly enhance the accuracy of a surface representation if the anisotropy of the triangulation conforms to the curvature of the surface [15]. Many methods to generate anisotropic triangulations are based on the notion of Rieman-nian metric and create triangulations whose elements adapt locally to the size and anisotropy prescribed by the local geometry. The numerous theoretical and practical results [1] of the Euclidean Voronoi diagram and its dual structure, the Delaunay triangulation, have pushed authors to try and extend these well-established concepts to the anisotropic setting. La-belle and Shewchuk [17] and Du and Wang [12] independently introduced two anisotropic Voronoi diagrams whose anisotropic distances are based on a discrete approximation of the Riemannian metric field. Contrary to their Euclidean counterpart, the fact that the dual of these anisotropic Voronoi diagrams is an embedded triangulation is not immediate, and, despite their strong theoretical foundations, the anisotropic Voronoi diagrams of Labelle and
Type de document :
Communication dans un congrès
Symposium on Computational Geometry SoCG 2017, Jul 2017, Brisbane, Australia. 2017, <10.4230/LIPIcs.SoCG.2017.19>
Liste complète des métadonnées
Contributeur : Jean-Daniel Boissonnat <>
Soumis le : mercredi 12 avril 2017 - 15:35:06
Dernière modification le : jeudi 15 juin 2017 - 09:09:18


Fichiers produits par l'(les) auteur(s)




Jean-Daniel Boissonnat, Mael Rouxel-Labbé, Mathijs Wintraecken. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. Symposium on Computational Geometry SoCG 2017, Jul 2017, Brisbane, Australia. 2017, <10.4230/LIPIcs.SoCG.2017.19>. <hal-01507111>



Consultations de
la notice


Téléchargements du document