Recommendations
Cites work
- Computational Geometry in C
- Discrete and computational geometry
- scientific article; zbMATH DE number 3251936 (Why is no real title available?)
- On a generalization of Schönhardt's polyhedron
- On Indecomposable Polyhedra
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Polygons Have Ears
- Triangulations. Structures for algorithms and applications
Cited in
(20)- Nonobtuse triangulation of polygons
- Unshellable triangulations of spheres
- Isohedra with nonconvex faces
- On the monotonization of polyhedra
- On weakly-neighbourly polyhedra
- Anti-Dürer conjecture for non-convex polyhedra
- scientific article; zbMATH DE number 1187141 (Why is no real title available?)
- scientific article; zbMATH DE number 1359481 (Why is no real title available?)
- scientific article; zbMATH DE number 1855642 (Why is no real title available?)
- scientific article; zbMATH DE number 2099946 (Why is no real title available?)
- scientific article; zbMATH DE number 2105675 (Why is no real title available?)
- scientific article; zbMATH DE number 903279 (Why is no real title available?)
- 2-toroids and their 3-triangulation
- On decomposition of embedded prismatoids in \(\mathbb{R}^3\) without additional points
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- On a generalization of Schönhardt's polyhedron
- Minimizing visible edges in polyhedra
- On the nonexistence of \(k\)-reptile tetrahedra
- Non-projectability of polytope skeleta
- Existence of polyhedra which cannot be decomposed into simplexes of equal volume
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)