Abstract
In this paper we show that every simple polygon can be triangulated with equal-diameter triangles. Our constructive proof does not give bounds for the number of triangles needed. We also show that every simple polygon can be partitioned into an infinite number of equal-perimeter triangles.
Similar content being viewed by others
References
Aigner, M., Ziegler, G.M.: Proofs from the Book, 4th edn. Springer, New York (2010)
Burago, Y.D., Zalgaller, V.A.: Polyhedral embedding of a net (Russian). Vestnik Leningrad Univ. 15, 66–80 (1960)
Cassidy, C., Lord, G.: A square acutely triangulated. J. Recreational Math. 13, 263–268 (1980–81)
De Loera, J., Rambau, J., Santos, F.: Triangulations. Structures for Algorithms and Applications, Algorithms and Computation in Mathematics, vol. 25 (2010)
Gardner, M.: Mathematical games. A fifth collection of ’brain-teasers’. Sci. Am. 202(2), 150–154 (1960)
Gardner, M.: Mathematical games. The games and puzzles of Lewis Caroll, and answers to February problems. Sci. Am. 202(3), 172–182 (1960)
Goldberg, M.: Advanced problems and solutions. Am. Math. Mon. 67(9), 923 (1960)
Maehara, H.: Acute triangulations of polygons. Eur. J. Combin. 23, 45–55 (2002)
Monsky, P.: On dividing a square into triangles. Am. Math. Mon. 77, 161–164 (1970)
Zamfirescu, C.T.: Survey of two-dimensional acute triangulations. Discrete Math. 313(1), 135–149 (2013)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bezdek, A., Bisztriczky, T. Finding equal-diameter triangulations in polygons. Beitr Algebra Geom 56, 541–549 (2015). https://doi.org/10.1007/s13366-014-0206-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13366-014-0206-6