Finding equal-diameter tetrahedralizations of polyhedra (Q1702740)

The following extension to the 3-dimensional case of 2-dimensional results by \textit{P. Monsky} [Am. Math. Mon. 77, 161--164 (1970, Zbl 0187.19701)] and \textit{A. Bezdek} and \textit{T. Bisztriczky} [Beitr. Algebra Geom. 56, No. 2, 541--549 (2015, Zbl 1332.52003)] is obtained. Every simple polyhedron (i.e., a 3-dimensional polyhedron whose vertices are adjacent to three edges and three faces) can be partitioned into a finite number of equal-diameter tetrahedra such that the intersection of any two tetrahedra is either empty or consists of a vertex, of an edge or of a face.