Anisotropic Delaunay Mesh Generation
- Others:
- Geometric computing (GEOMETRICA) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France ; Institut National de Recherche en Informatique et en Automatique (Inria)
- Understanding the Shape of Data (DATASHAPE) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France ; Institut National de Recherche en Informatique et en Automatique (Inria)
- ANR-09-BLAN-0331,GIGA(2009)
- European Project: 339025,EC:FP7:ERC,ERC-2013-ADG,GUDHI(2014)
Description
Anisotropic meshes are triangulations of a given domain in the plane or in higher dimensions, with elements elongated along prescribed directions. Anisotropic trian-gulations are known to be well suited for interpolation of functions or solving PDEs. Assuming that the anisotropic shape requirements for mesh elements are given through a metric field varying over the domain, we propose a new approach to anisotropic mesh generation, relying on the notion of anisotropic Delaunay meshes. An anisotropic De-launay mesh is defined as a mesh in which the star of each vertex v consists of simplices that are Delaunay for the metric associated to vertex v. This definition works in any dimension and allows to define a simple refinement algorithm. The algorithm takes as input a domain and a metric field and provides, after completion, an anisotropic mesh whose elements are sized and shaped according to the metric field.
Abstract
International audience
Additional details
- URL
- https://hal.inria.fr/hal-01251628
- URN
- urn:oai:HAL:hal-01251628v2
- Origin repository
- UNICA