3D boundary recovery by constrained Delaunay tetrahedralization
From MaRDI portal
Publication:3018042
DOI10.1002/nme.3016zbMath1217.65216MaRDI QIDQ3018042
No author found.
Publication date: 20 July 2011
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.3016
Steiner points; constrained Delaunay tetrahedralization; boundary recovery; tetrahedral mesh generation
65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
65M50: Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs
Related Items
Efficient Predicate Evaluation Using Randomized Degeneracy Detection, TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator, The surface‐reconstruction virtual‐region mesh update method for problems with topology changes, Vortex analysis of intra-aneurismal flow in cerebral aneurysms, Improved boundary constrained tetrahedral mesh generation by shell transformation, An integrated approach for the conformal discretization of complex inclusion-based microstructures
Cites Work
- Unnamed Item
- An acyclicity theorem for cell complexes in d dimensions
- Triangulating a nonconvex polytope
- Generalized Delaunay triangulation for planar graphs
- Constrained Delaunay triangulations
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Automatic mesh generator with specified boundary
- Approximating constrained tetrahedrizations
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
- Erased arrangements of linear and convex decompositions of polyhedra
- Surface reconstruction by Voronoi filtering
- Applications of random sampling in computational geometry. II
- Bounds on the size of tetrahedralizations
- Incremental topological flipping works for regular triangulations
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- 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
- Adaptive tetrahedral mesh generation by constrained Delaunay refinement
- A Quadratic Time Algorithm for the Minmax Length Triangulation
- Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Coarsening unstructured meshes by edge contraction
- ?Ultimate? robustness in meshing an arbitrary polyhedron
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- Measuring Mesh Qualities and Application to Variational Mesh Adaptation
- Updating and constructing constrained delaunay and constrained regular triangulations by flips
- QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES
- Provably good sampling and meshing of surfaces
