Approximating constrained tetrahedrizations
algorithmcomputational geometrycomputer aided designDelaunay triangulationspseudo-manifold simplicial complextetrahedrization
Computational aspects related to convexity (52B55) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07)
It was shown by \textit{E. Schönhardt} [Mat. Ann. 89, 309-312 (1927; JFM 53.0576.01)] that it is not always possible to turn a given set of points in \(\mathbb{R}^ 3\) into the vertices of a pseudo-manifold simplicial complex and such that a preassigned triangle should appear as a face in the complex. In computer aided design one has the additional problem that one would like to work with Delaunay triangulations for which many procedures are available. \textit{A. K. Cline} and \textit{R. J. Renka} [SIAM J. Numer. Anal. 27, No. 5, 1305-1321 (1990; Zbl 0714.65024)] relaxed the definition of a Delaunay triangulation in the case of two-dimensional problems to give an algorithm that allows the incorporation of pre-assigned segments. The author shows that a three-dimensional analogue of the Cline and Renka definition also leads to problems without solution. She therefore relaxes the conditions still more to obtain an explicit procedure that from a (Delaunay) triangulation \(T'\) of a pointset \(P'\) and a finite collection \(R\) of planar convex polygonal regions returns a set \(P\) and triangulation \(T\) of \(P\) such that \(P\setminus P' \in R\), \(T\) coincides with \(T'\) except for tetrahedra that are intersected (but not in face) by a region in \(R\) and any polygon in \(R\) is the union of faces of tetrahedra in \(T\). The procedure is linear in the number of tetrahedra in \(T'\) but exponential in the number of members of \(R\).
- Construction of three-dimensional Delaunay triangulations using local transformations
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- OPTIMAL DELAUNAY POINT INSERTION
- scientific article; zbMATH DE number 878982
- Conforming Delaunay triangulations in 3D
- Fast Delaunay triangulation in three dimensions
- Realizability of Delaunay triangulations
- An optimal algorithm for realizing a Delaunay triangulation
- Conforming Delaunay triangulations in 3D
- C^ 1 trivariate polynomial interpolation
- A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
- A discrete \(C^ 1\) interpolant for tetrahedral data
- Delaunay Triangular Meshes in Convex Polygons
- Delaunay triangulation of arbitrarily shaped planar domains
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- Properties of n-dimensional triangulations
- Tetrahedrizing point sets in three dimensions
- Three- and four-dimensional surfaces
- Triangular meshes for regions of complicated shape
- Triangulation automatique d’un polyèdre en dimension $N$
- Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
- Simplicial mesh of an arbitrary polyhedron.
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- Variational Delaunay approach to the generation of tetrahedral finite element meshes
- 3D boundary recovery by constrained Delaunay tetrahedralization
- Closure constraints for hyperbolic tetrahedra
- Triangulation sous contraintes en dimension quelconque
- Constrained Triangulations, Volumes of Polytopes, and Unit Equations
- A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
- The legacy of automatic mesh generation from solid modeling
This page was built for publication: Approximating constrained tetrahedrizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208496)
