A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points

DOI10.1007/978-3-030-23436-2_4MaRDI QIDQ5114888zbMATH OpenOpenAlexFDO

Authors Hang Si

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

zbMATH Keywords

monotone sequenceSteiner pointsflip graphnon-regular triangulationsweighted Delaunay triangulationsindecomposable polyhedraSchönhardt polyhedrondirected flipsLawson's flip algorithmredundant interior vertices

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyhedra and polytopes; regular figures, division of spaces (51M20)

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

Cites work

• scientific article; zbMATH DE number 741009 (Why is no real title available?)
• scientific article; zbMATH DE number 3251936 (Why is no real title available?)
• ?Ultimate? robustness in meshing an arbitrary polyhedron
• Automatic mesh generator with specified boundary
• Bounds on the size of tetrahedralizations
• Cell decomposition of polytopes by bending
• Constrained Delaunay triangulations
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
• Erased arrangements of linear and convex decompositions of polyhedra
• Generalized Delaunay triangulation for planar graphs
• On Indecomposable Polyhedra
• On a generalization of Schönhardt's polyhedron
• On nontriangulable polyhedra
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• TetGen, a Delaunay-based quality tetrahedral mesh generator
• The higher Stasheff‐Tamari posets
• Triangulating a nonconvex polytope
• Triangulations. Structures for algorithms and applications

Cited in

(4)

• scientific article; zbMATH DE number 1696645 (Why is no real title available?)
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
• Simplicial mesh of an arbitrary polyhedron.

Describes a project that uses

Uses Software

• TetGen

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)