3D boundary recovery by constrained Delaunay tetrahedralization
type: Item
instance of: scholarly article
title: 3D boundary recovery by constrained Delaunay tetrahedralization
zbMATH Open document ID: 1217.65216
published in: International Journal for Numerical Methods in Engineering
publication date: 2011-07-20T00:00:00Z
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 65M50
zbMATH DE Number: 5929375
zbMATH Keywords: tetrahedral mesh generation
zbMATH Keywords: boundary recovery
zbMATH Keywords: constrained Delaunay tetrahedralization
zbMATH Keywords: Steiner points
MaRDI profile type: Publication
full work available at URL: nme.3016
OpenAlex ID: W2009209832
cites work: On the difficulty of triangulating three-dimensional nonconvex polyhedra
cites work: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
cites work: Automatic mesh generator with specified boundary
cites work: Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
cites work: ?Ultimate? robustness in meshing an arbitrary polyhedron
cites work: Triangulating a nonconvex polytope
cites work: Bounds on the size of tetrahedralizations
cites work: Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions
cites work: Erased arrangements of linear and convex decompositions of polyhedra
cites work: Generalized Delaunay triangulation for planar graphs
cites work: Approximating constrained tetrahedrizations
cites work: Adaptive tetrahedral mesh generation by constrained Delaunay refinement
cites work: Updating and constructing constrained delaunay and constrained regular triangulations by flips
cites work: Measuring Mesh Qualities and Application to Variational Mesh Adaptation
cites work: Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
cites work: Applications of random sampling in computational geometry. II
cites work: Incremental topological flipping works for regular triangulations
cites work: Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
cites work: A Quadratic Time Algorithm for the Minmax Length Triangulation
cites work: Constrained Delaunay triangulations
cites work: General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
cites work: An acyclicity theorem for cell complexes in d dimensions
cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
cites work: A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
cites work: Coarsening unstructured meshes by edge contraction
cites work: Q4385944
cites work: Provably good sampling and meshing of surfaces
cites work: Surface reconstruction by Voronoi filtering
cites work: QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES
DOI: 10.1002/NME.3016
description: scientific article