Finding equal-diameter tetrahedralizations of polyhedra

DOI10.1007/S13366-017-0344-8MaRDI QIDQ1702740zbMATH OpenOpenAlexFDO

Authors Antal Joós

Publication date 28 February 2018

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

Full work available at URL https://doi.org/10.1007/s13366-017-0344-8

zbMATH Keywords

polyhedrontetrahedralizationtetrahedrontriangulation

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Review text

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.

Recommendations

• Finding equal-diameter triangulations in polygons
• An isoperimetric problem for tetrahedra
• scientific article; zbMATH DE number 1440643
• scientific article; zbMATH DE number 957407
• On primitive subdivisions of an elementary tetrahedron.

Cites work

• Finding equal-diameter triangulations in polygons
• On Dividing a Square Into Triangles
• Survey of two-dimensional acute triangulations
• Triangulations. Structures for algorithms and applications

Cited in

(3)

• Developing a tetramonohedron with minimum cut length
• Triangle-Free Partitions of Euclidean Space
• Finding equal-diameter triangulations in polygons

This page was built for publication: Finding equal-diameter tetrahedralizations of polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702740)