A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
DOI10.1007/978-3-030-23436-2_4zbMath1445.68265OpenAlexW2979406396MaRDI QIDQ5114888
Publication date: 29 June 2020
Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-23436-2_4
Steiner pointsmonotone sequenceflip graphnon-regular triangulationsweighted Delaunay triangulationsindecomposable polyhedraSchönhardt polyhedrondirected flipsLawson's flip algorithmredundant interior vertices
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangulating a nonconvex polytope
- Triangulations. Structures for algorithms and applications
- Generalized Delaunay triangulation for planar graphs
- Constrained Delaunay triangulations
- Cell decomposition of polytopes by bending
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Automatic mesh generator with specified boundary
- Erased arrangements of linear and convex decompositions of polyhedra
- Bounds on the size of tetrahedralizations
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- ?Ultimate? robustness in meshing an arbitrary polyhedron
- The higher Stasheff‐Tamari posets
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
- On Indecomposable Polyhedra
- On nontriangulable polyhedra
This page was built for publication: A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
