Engineering with Computers: Volume 33 Issue 3, July 2017
Existing flips for tetrahedral meshes simply make a selection from a few possible configurations within a single shell (i.e., a polyhedron that can be filled up with a mesh composed of a set of elements that meet each other at one edge), and their effectiveness is usually confined. A new ...
Topological transformation, Mesh generation, Shell transformation, Tetrahedral meshes, Mesh improvement, Mesh smoothing
Computer-Aided Design: Volume 85 Issue C, April 2017
We generalize the higher embedding approach proposed in Lvy and Bonneel (2013) to generate an adapted mesh matching the intrinsic directionalities of an assigned function. In more detail, the original embedding map between the physical (lower dimensional) and the embedded (higher dimensional) setting is modified to include information associated with ...
Higher dimensional embedding, Mesh adaptation, Anisotropic meshes, Partial differential equations
ACM Transactions on Mathematical Software (TOMS): Volume 41 Issue 2, January 2015
Citation Count: 44
Downloads (6 Weeks): 68, Downloads (12 Months): 685, Downloads (Overall): 2,448
Full text available:
TetGen is a C++ program for generating good quality tetrahedral meshes aimed to support numerical methods and scientific computing. The problem of quality tetrahedral mesh generation is challenged by many theoretical and practical issues. TetGen uses Delaunay-based algorithms which have theoretical guarantee of correctness. It can robustly handle arbitrary complex ...
Steiner points, Tetrahedral mesh generation, boundary recovery, mesh quality, mesh improvement, Delaunay, constrained Delaunay, edge removal, flips, mesh refinement
SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry
Citation Count: 2
Downloads (6 Weeks): 0, Downloads (12 Months): 19, Downloads (Overall): 192
Full text available:
Most algorithms for guaranteed-quality tetrahedral mesh generation create Delaunay meshes. Delaunay triangulations have many good properties, but the requirement that all tetrahedra be Delaunay often forces mesh generators to overrefine where boundary polygons meet at small angles---that is, they produce too many tetrahedra, making them too small. Relaxing the Delaunay ...
Delaunay refinement algorithm, tetrahedral mesh generation, constrained Delaunay triangulation
Finite Elements in Analysis and Design: Volume 46 Issue 1-2, January, 2010
Publisher: Elsevier Science Publishers B. V.
A constrained Delaunay tetrahedralization of a domain in R^3 is a tetrahedralization such that it respects the boundaries of this domain, and it has properties similar to those of a Delaunay tetrahedralization. Such objects have various applications such as finite element analysis, computer graphics rendering, geometric modeling, and shape analysis. ...
GIScience '08: Proceedings of the 5th international conference on Geographic Information Science
Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersecting polygons or open gaps to external validation rules. If this testing is not performed well, or not at all, non-valid polyhedra could be stored in ...