On nontriangulable polyhedra
From MaRDI portal
Publication:5962892
DOI10.1007/S13366-015-0248-4zbMATH Open1334.52012OpenAlexW633573019MaRDI QIDQ5962892FDOQ5962892
Authors: A. Bezdek, Braxton Carrigan 
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
Recommendations
Three-dimensional polytopes (52B10) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Convex sets in (3) dimensions (including convex surfaces) (52A15)
Cites Work
- Triangulations. Structures for algorithms and applications
- Computational Geometry in C
- Title not available (Why is that?)
- Discrete and computational geometry
- On a generalization of Schönhardt's polyhedron
- Polygons Have Ears
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- On Indecomposable Polyhedra
Cited In (19)
- Isohedra with nonconvex faces
- On weakly-neighbourly polyhedra
- Non-projectability of polytope skeleta
- Anti-Dürer conjecture for non-convex polyhedra
- Unshellable triangulations of spheres
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- On the monotonization of polyhedra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points
- On a generalization of Schönhardt's polyhedron
- On the nonexistence of \(k\)-reptile tetrahedra
- Nonobtuse triangulation of polygons
- Existence of polyhedra which cannot be decomposed into simplexes of equal volume
- Minimizing visible edges in polyhedra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On nontriangulable polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962892)
