This paper describes a new method for increasing the number and the volume of hexahedral and prism elements in a hexdominant mesh by topological transformations. The method takes ...
The 8-tetrahedra longest-edge (8T-LE) partition of any tetrahedron is defined in terms of three consecutive edge bisections, the first one performed by the longest-edge. The ass...
A Cartesian grid generation methodology is developed for unsteady control volume computational fluid dynamic (CFD) solvers. Arbitrary combinations and numbers of moving and statio...
Motivated by Lagrangian simulation of elastic deformation, we propose a new tetrahedral mesh generation algorithm that produces both high quality elements and a mesh that is well ...
Neil Molino, Robert Bridson, Joseph Teran, Ronald ...
Unstructured mesh adaptation has already revealed very efficient for computing an accurate solution in a reasonnable amount of time on current PC architectures. Two features are s...
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph ...
This paper presents a comprehensive approach for CAD based geometry handling in support of single and multidisciplinary analysis and design. Unlike previous schemes, the model pre...
Parameterizations of triangulated surfaces are used in an increasing number of mesh processing applications for various purposes. Although demands vary, they are often required to...
Quadratic elements place stringent requirements on a surface mesh smoother. One of the biggest challenges is that a good linear element may become invalid when mid-side nodes are ...
This paper describes the creation of a new type of size function – the mesh size function that honors the existing mesh on premeshed geometry entities and radiates the mesh size...