14 research outputs found
CGAL - The Computational Geometry Algorithms Library
National audienceSee http://hal.archives-ouvertes.fr/docs/00/59/26/85/ANNEX/r_3NE2KWB7.pd
Adaptive Tetrahedral Meshing for Personalized Cardiac Simulations
International audiencePersonalized simulation for therapy planning in the clinical routine requires fast and accurate computations. Finite-element (FE) simulations belong to the most commonly used approaches. Based on medical images the geometry of the patient's anatomy must be faithfully represented and discretized in a way to find a reasonable compromise between accuracy and speed. This can be achieved by adapting the mesh resolution, and by providing well-shaped elements to improve the convergence of iterative solvers. We present a pipeline for generating high-quality, adaptive meshes, and show how the framework can be applied to specific cardiac simulations. Our aim is to analyze the meshing requirements for applications in electrophysiological modeling of ventricular tachycardia and electromechanical modeling of Tetralogy of Fallot
Lp Centroidal Voronoi Tesselation and its applications
International audienceThis paper introduces Lp -Centroidal Voronoi Tessellation (Lp -CVT), a generalization of CVT that minimizes a higher-order moment of the coordinates on the Voronoi cells. This generalization allows for aligning the axes of the Voronoi cells with a predefined background tensor field (anisotropy). Lp -CVT is computed by a quasi-Newton optimization framework, based on closed-form derivations of the objective function and its gradient. The derivations are given for both surface meshing (Ω is a triangulated mesh with per-facet anisotropy) and volume meshing (Ω is the interior of a closed triangulated mesh with a 3D anisotropy field). Applications to anisotropic, quad-dominant surface remeshing and to hex-dominant volume meshing are presented. Unlike previous work, Lp -CVT captures sharp features and intersections without requiring any pre-tagging
VoroCrust: Voronoi Meshing Without Clipping
Polyhedral meshes are increasingly becoming an attractive option with
particular advantages over traditional meshes for certain applications. What
has been missing is a robust polyhedral meshing algorithm that can handle broad
classes of domains exhibiting arbitrarily curved boundaries and sharp features.
In addition, the power of primal-dual mesh pairs, exemplified by
Voronoi-Delaunay meshes, has been recognized as an important ingredient in
numerous formulations. The VoroCrust algorithm is the first provably-correct
algorithm for conforming polyhedral Voronoi meshing for non-convex and
non-manifold domains with guarantees on the quality of both surface and volume
elements. A robust refinement process estimates a suitable sizing field that
enables the careful placement of Voronoi seeds across the surface circumventing
the need for clipping and avoiding its many drawbacks. The algorithm has the
flexibility of filling the interior by either structured or random samples,
while preserving all sharp features in the output mesh. We demonstrate the
capabilities of the algorithm on a variety of models and compare against
state-of-the-art polyhedral meshing methods based on clipped Voronoi cells
establishing the clear advantage of VoroCrust output.Comment: 18 pages (including appendix), 18 figures. Version without compressed
images available on https://www.dropbox.com/s/qc6sot1gaujundy/VoroCrust.pdf.
Supplemental materials available on
https://www.dropbox.com/s/6p72h1e2ivw6kj3/VoroCrust_supplemental_materials.pd
Structure-Preserving Discretization of Incompressible Fluids
The geometric nature of Euler fluids has been clearly identified and
extensively studied over the years, culminating with Lagrangian and Hamiltonian
descriptions of fluid dynamics where the configuration space is defined as the
volume-preserving diffeomorphisms, and Kelvin's circulation theorem is viewed
as a consequence of Noether's theorem associated with the particle relabeling
symmetry of fluid mechanics. However computational approaches to fluid
mechanics have been largely derived from a numerical-analytic point of view,
and are rarely designed with structure preservation in mind, and often suffer
from spurious numerical artifacts such as energy and circulation drift. In
contrast, this paper geometrically derives discrete equations of motion for
fluid dynamics from first principles in a purely Eulerian form. Our approach
approximates the group of volume-preserving diffeomorphisms using a finite
dimensional Lie group, and associated discrete Euler equations are derived from
a variational principle with non-holonomic constraints. The resulting discrete
equations of motion yield a structure-preserving time integrator with good
long-term energy behavior and for which an exact discrete Kelvin's circulation
theorem holds
A Line/Trimmed NURBS Surface Intersection Algorithm Using Matrix Representations
International audienceWe contribute a reliable line/surface intersection method for trimmed NURBS surfaces, based on a novel matrix-based implicit representation and numerical methods in linear algebra such as singular value decomposition and the computation of generalized eigenvalues and eigenvectors. A careful treatment of degenerate cases makes our approach robust to intersection points with multiple pre-images. We then apply our intersection algorithm to mesh NURBS surfaces through Delaunay refinement. We demonstrate the added value of our approach in terms of accuracy and treatment of degenerate cases, by providing comparisons with other intersection approaches as well as a variety of meshing experiments