Abstract- In this paper a systematic approach of repairing polygonal meshes is developed for volume meshing, which can then be used in finite element analyses. All poor-quality elements are classified into three general categories: point element, line element, and overlapped element. A robust iterative scheme is proposed to remove all poor-quality elements progressively, leading to a successful volume meshing for finite element analyses. Our method is general, robust, and capable of handling non-manifold surface meshes as long as the input mesh is watertight, which is the basic requirement for volume meshing. Numerical experiments demonstrate the effectiveness of our approach
Two methods for calculating the volume and surface area of the intersection between a triangle mesh ...
International audienceLimitations of current 3D acquisition technology often lead to polygonal meshe...
Two methods for calculating the volume and surface area of the intersection between a triangle mesh ...
Two important tools for manipulating polygonal models are simplification and repair, and we present ...
When designing novel algorithms for geometric processing and analysis, researchers often assume that...
In this work we present polygonal finite element method (Poly-FEM) for the analysis of two dimension...
We describe an algorithm for repairing polyhedral CAD models that have errors in their B-REP. Errors...
We describe an algorithm for repairing polyhedral CAD models that have errors in their B-REP. Errors...
Nowadays large part of the time needed to perform a numerical simulation is spent in preprocessing, ...
This paper describes a new computational method for creating a triangular and quadrilateral mesh of ...
Because of the rapid evolution of 3D acquisition and modelling methods, highly complex and detailed ...
The topic of this thesis is the intersection of a structured hexahedral grid andone or more triangle...
Within this paper we discuss a numerical strategy to solve the elasticity problem upon unstructured ...
The paper presents a parallel tetrahedral mesh generation approach based on recursive bidivisions us...
For twenty years, it has been clear that many datasets are excessively complex for applications such...
Two methods for calculating the volume and surface area of the intersection between a triangle mesh ...
International audienceLimitations of current 3D acquisition technology often lead to polygonal meshe...
Two methods for calculating the volume and surface area of the intersection between a triangle mesh ...
Two important tools for manipulating polygonal models are simplification and repair, and we present ...
When designing novel algorithms for geometric processing and analysis, researchers often assume that...
In this work we present polygonal finite element method (Poly-FEM) for the analysis of two dimension...
We describe an algorithm for repairing polyhedral CAD models that have errors in their B-REP. Errors...
We describe an algorithm for repairing polyhedral CAD models that have errors in their B-REP. Errors...
Nowadays large part of the time needed to perform a numerical simulation is spent in preprocessing, ...
This paper describes a new computational method for creating a triangular and quadrilateral mesh of ...
Because of the rapid evolution of 3D acquisition and modelling methods, highly complex and detailed ...
The topic of this thesis is the intersection of a structured hexahedral grid andone or more triangle...
Within this paper we discuss a numerical strategy to solve the elasticity problem upon unstructured ...
The paper presents a parallel tetrahedral mesh generation approach based on recursive bidivisions us...
For twenty years, it has been clear that many datasets are excessively complex for applications such...
Two methods for calculating the volume and surface area of the intersection between a triangle mesh ...
International audienceLimitations of current 3D acquisition technology often lead to polygonal meshe...
Two methods for calculating the volume and surface area of the intersection between a triangle mesh ...