On nontriangulable polyhedra

DOI10.1007/s13366-015-0248-4zbMath1334.52012OpenAlexW633573019MaRDI QIDQ5962892

Braxton Carrigan, Andras Bezdek

Publication date: 25 February 2016

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13366-015-0248-4

zbMATH Keywords

triangulationpolyhedrontilingnontileablenot triangulablepartitions with tetrahedratwisted prisms

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Convex sets in (3) dimensions (including convex surfaces) (52A15) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (3)

Minimizing visible edges in polyhedra ⋮ A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points ⋮ On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulations. Structures for algorithms and applications
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Polygons Have Ears
• Computational Geometry in C
• On Indecomposable Polyhedra

This page was built for publication: On nontriangulable polyhedra