TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
Publication:5270714
DOI10.1145/2629697zbMath1369.65157OpenAlexW2109991971WikidataQ113310288 ScholiaQ113310288MaRDI QIDQ5270714
Publication date: 30 June 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2629697
Steiner pointsmesh refinementflipsedge removalmesh qualityDelaunaymesh improvementboundary recoverytetrahedral mesh generationconstrained Delaunay
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Packaged methods for numerical algorithms (65Y15)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conforming Delaunay triangulations in 3D
- Optimally adapted meshes for finite elements of arbitrary order and \(W^{1,p}\) norms
- Towards exact geometric computation
- Triangulating a nonconvex polytope
- Generalized Delaunay triangulation for planar graphs
- Primitives for the manipulation of three-dimensional subdivisions
- Constrained Delaunay triangulations
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Automatic mesh generator with specified boundary
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- NETGEN: An advancing front 2D/3D-mesh generator based on abstract rules
- Automatic generation of staged geometric predicates
- Applications of random sampling in computational geometry. II
- Incremental topological flipping works for regular triangulations
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- Geometry and Topology for Mesh Generation
- CGALmesh
- Sliver exudation
- Boundary conforming Delaunay mesh generation
- 3D boundary recovery by constrained Delaunay tetrahedralization
- WALKING IN A TRIANGULATION
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- OPTIMAL DELAUNAY POINT INSERTION
- Triangulating Topological Spaces
- The quickhull algorithm for convex hulls
- Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations
- ?Ultimate? robustness in meshing an arbitrary polyhedron
- Higher-Quality Tetrahedral Mesh Generation for Domains with Small Angles by Constrained Delaunay Refinement
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
- EXACT GEOMETRIC COMPUTATION USING CASCADING
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Mesh data structure selection for mesh generation and FEA applications
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
- Quality Mesh Generation in Higher Dimensions
- Measuring Mesh Qualities and Application to Variational Mesh Adaptation
- Updating and constructing constrained delaunay and constrained regular triangulations by flips
- Incremental constructions con BRIO
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
- QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES
- Constrained boundary recovery for three dimensional Delaunay triangulations
This page was built for publication: TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator