Approximating constrained tetrahedrizations

DOI10.1016/0167-8396(93)90052-5zbMath0772.65099OpenAlexW2076027724MaRDI QIDQ1208496

Carol Hazlewood

Publication date: 16 May 1993

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(93)90052-5

zbMATH Keywords

algorithmcomputer aided designcomputational geometryDelaunay triangulationspseudo-manifold simplicial complextetrahedrization

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (6)

Simplicial mesh of an arbitrary polyhedron. ⋮ Variational Delaunay approach to the generation of tetrahedral finite element meshes ⋮ The legacy of automatic mesh generation from solid modeling ⋮ 3D boundary recovery by constrained Delaunay tetrahedralization ⋮ General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties ⋮ Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation

Uses Software

• Algorithm 624

Cites Work

• Unnamed Item
• Properties of \(n\)-dimensional triangulations
• Three- and four-dimensional surfaces
• A discrete \(C^ 1\) interpolant for tetrahedral data
• \(C^ 1\) trivariate polynomial interpolation
• Delaunay triangulation of arbitrarily shaped planar domains
• Tetrahedrizing point sets in three dimensions
• A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
• Triangulation automatique d’un polyèdre en dimension $N$
• Triangular meshes for regions of complicated shape
• Delaunay Triangular Meshes in Convex Polygons

This page was built for publication: Approximating constrained tetrahedrizations