A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
DOI10.1007/978-3-030-23436-2_4zbMATH Open1445.68265OpenAlexW2979406396MaRDI QIDQ5114888FDOQ5114888
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
Recommendations
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- A non-recursive algorithm for polygon triangulation
- Triangulating a nonconvex polytope
- A contribution to triangulation algorithms for simple polygons
- Nonobtuse triangulation of polygons
- A New Triangulation for Simplicial Algorithms
- Approximation for minimum triangulations of simplicial convex 3-polytopes
- On triangulations of the convex hull of n points
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
monotone sequenceSteiner pointsflip 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)
Cites Work
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
- Triangulations. Structures for algorithms and applications
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Title not available (Why is that?)
- Triangulating a nonconvex polytope
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Automatic mesh generator with specified boundary
- Generalized Delaunay triangulation for planar graphs
- Constrained Delaunay triangulations
- On a generalization of Schönhardt's polyhedron
- Bounds on the size of tetrahedralizations
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- ?Ultimate? robustness in meshing an arbitrary polyhedron
- On nontriangulable polyhedra
- Title not available (Why is that?)
- The higher Stasheff‐Tamari posets
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Cell decomposition of polytopes by bending
- Erased arrangements of linear and convex decompositions of polyhedra
- On Indecomposable Polyhedra
Cited In (3)
Uses Software
This page was built for publication: A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114888)
