On nontriangulable polyhedra

Bezdek, András and Carrigan, B. (2016) On nontriangulable polyhedra. BEITRÄGE ZUR ALGEBRA UND GEOMETRIE, 57 (1). pp. 51-66. ISSN 0138-4821

[img] Text
Restricted to Registered users only

Download (1MB) | Request a copy


Triangulations of 3-dimensional polyhedron are partitions of the polyhedron with tetrahedra in a face-to-face fashion without introducing new vertices. Schönhardt (Math. Ann. 89:309–312, 1927), Bagemihl (Amer. Math. Mon. 55:411–413, 1948), Kuperberg (Personal communication 2011) and others constructed special polyhedra in such a way that clever one line geometric reasons imply nontriangulability. Rambau (Comb. Comput. Geom. 52:501–516, 2005) proved that twisted prisms over n-gons are nontriangulable. Our approach for proving polyhedra are nontriangulable is to show that partitions with tetrahedra, which we call tilings, do not exist even if the face-to-face-restriction is relaxed. First we construct a polyhedron which is tileable but is not triangulable. Then we revisit Rambau type twisted prisms. In fact we consider a slightly different class of polyhedra, and prove that these new twisted prisms are nontileable, thus are nontriangulable. We also show that one can twist the regular dodecahedron so that it becomes nontileable, which is abstracted to a new family of nontileable polyhedra, called nonconvex twisted pentaprisms. © 2015, The Managing Editors.

Item Type: Article
Uncontrolled Keywords: TRIANGULATION; Tiling; Polyhedron
Subjects: Q Science / természettudomány > QA Mathematics / matematika
Q Science / természettudomány > QA Mathematics / matematika > QA73 Geometry / geometria
Depositing User: MTMT SWORD
Date Deposited: 03 Jan 2017 08:22
Last Modified: 03 Jan 2017 08:22

Actions (login required)

Edit Item Edit Item