Franck Ledoux
YOU?
Author Swipe
View article: Software transactional memory for parallel meshing applications
Software transactional memory for parallel meshing applications Open
International audience
View article: Validity-first automatic polycube labeling for CAD models
Validity-first automatic polycube labeling for CAD models Open
For many simulation codes, block-structured hex meshes remain preferred while their automatic generation is unsolved. We investigate the usage of a polycube-based approach. More specifically, we focus on the labeling stage, which consists …
View article: Mixed-Order Meshes through rp-adaptivity for Surface Fitting to Implicit Geometries
Mixed-Order Meshes through rp-adaptivity for Surface Fitting to Implicit Geometries Open
Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes. E…
View article: Hex-Mesh Generation and Processing: A Survey
Hex-Mesh Generation and Processing: A Survey Open
In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post-processing algorithms for connectivity editing and mesh o…
View article: Hex Me If You Can
Hex Me If You Can Open
HexMe consists of 189 tetrahedral meshes with tagged features and a workflow to generate them. The primary purpose of HexMe meshes is to enable consistent and practically meaningful evaluation of hexahedral meshing algorithms and related t…
View article: HexMe dataset
HexMe dataset Open
First version (HexMe-1.0) of HexMe dataset. This version corresponds to the one detailed in the paper "Hex Me If You Can", Beaufort et al. (2022) The dataset consists of 189 tetrahedral meshes (vtk datafile version 2, ASCII mode), with tag…
View article: HexMe dataset
HexMe dataset Open
First version (HexMe-1.0) of HexMe dataset. This version corresponds to the one detailed in the paper "Hex Me If You Can", Beaufort et al. (2022) The dataset consists of 189 tetrahedral meshes (vtk datafile version 2, ASCII mode), with tag…
View article: Robust Quantization for Polycube Maps
Robust Quantization for Polycube Maps Open
View article: Evocube: a Genetic Labeling Framework for Polycube-Maps
Evocube: a Genetic Labeling Framework for Polycube-Maps Open
Polycube-maps are used as base-complexes in various fields of computational geometry, including the generation of regular all-hexahedral meshes free of internal singularities. However, the strict alignment constraints behind polycube-based…
View article: Evocube: a Genetic Labeling Framework for Polycube-Maps
Evocube: a Genetic Labeling Framework for Polycube-Maps Open
Polycube-maps are used as base-complexes in various fields of computational geometry, including the generation of regular all-hexahedral meshes free of internal singularities. However, the strict alignment constraints behind polycube-based…
View article: Hex-Mesh Generation and Processing: a Survey
Hex-Mesh Generation and Processing: a Survey Open
In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post processing algorithms for connectivity editing and mesh o…
View article: Hex Me If You Can.
Hex Me If You Can. Open
HEXME consists of tetrahedral meshes with tagged features, and of a workflow to generate them. The main purpose of HEXME meshes is to enable consistent and fair evaluation of hexahedral meshing algorithms and related techniques. The tetrah…
View article: Hex Me If You Can
Hex Me If You Can Open
HEXME consists of tetrahedral meshes with tagged features, and of a workflow to generate them. The main purpose of HEXME meshes is to enable consistent and fair evaluation of hexahedral meshing algorithms and related techniques. The tetrah…
View article: Guaranteed Quality-Driven Hexahedral Overlay Grid Method
Guaranteed Quality-Driven Hexahedral Overlay Grid Method Open
Hexahedral mesh generation using overlay grid methods has the benefit of being fully automatic, requiring minimal user input. These methods follow a mesh-first approach where an initial mesh, usually a grid, is used to overlay the referenc…
View article: A Multilevel Mesh Partitioning Algorithm Driven by Memory Constraints
A Multilevel Mesh Partitioning Algorithm Driven by Memory Constraints Open
Running numerical simulations on HPC architectures requires distributing data to be processed over the various available processing units. This task is usually done by partitioning tools, whose primary goal is to balance the workload while…
View article: Hex-dominant meshing: mind the gap!
Hex-dominant meshing: mind the gap! Open
International audience
View article: Hexahedral Meshing: Mind the Gap!
Hexahedral Meshing: Mind the Gap! Open
This article introduces a method to generate a hex-dominant mesh from an input tet mesh. We first compute a global parameterization, then we isolate the ``void'' (also called ``gap'' or ``cavity''), that is the zone where the global parame…
View article: Scalable Fine-Grained Metric-Based Remeshing Algorithm for Manycore/NUMA Architectures
Scalable Fine-Grained Metric-Based Remeshing Algorithm for Manycore/NUMA Architectures Open
View article: Volume preservation improvement for interface reconstruction hexahedral methods
Volume preservation improvement for interface reconstruction hexahedral methods Open
We propose a new post-processing procedure for automatically adjusting node locations of an all-hex mesh to better match the volume of a reference geometry. Hexahedral meshes generated via an overlay grid procedure, where a precise referen…
View article: Analysis of Non-Meshable Automatically Generated Frame fields.
Analysis of Non-Meshable Automatically Generated Frame fields. Open
View article: Partitionnement de maillages sous contrainte mémoire à l'aide de la programmation linéaire en nombres entiers
Partitionnement de maillages sous contrainte mémoire à l'aide de la programmation linéaire en nombres entiers Open
International audience
View article: Fine-grained Locality-aware Parallel Scheme for Anisotropic Mesh Adaptation
Fine-grained Locality-aware Parallel Scheme for Anisotropic Mesh Adaptation Open
International audience