Finding equal-diameter triangulations in polygons
type: Item
instance of: scholarly article
title: Finding equal-diameter triangulations in polygons
zbMATH Open document ID: 1332.52003
published in: Beiträge zur Algebra und Geometrie
publication date: 2015-10-16T00:00:00Z
review text: A plane polygon is called simple if the edges do not cross each other. The authors give a constructive proof that every simple plane polygon can be partitioned into a finite number of equal-diameter triangles such that the intersection of any two triangles is either empty or consists of a vertex or an edge. They also show that every simple plane polygon can be partitioned into infinitely many equal-perimeter triangles.
reviewed by: Egon Schulte
Mathematics Subject Classification ID: 52A10
Mathematics Subject Classification ID: 52C15
zbMATH DE Number: 6495586
zbMATH Keywords: simple plane polygon
zbMATH Keywords: triangulation
zbMATH Keywords: diameter
zbMATH Keywords: perimeter
Wikidata QID: Q56225371
author: A. Bezdek
author: T. Bisztriczky
MaRDI profile type: Publication
full work available at URL: s13366-014-0206-6
OpenAlex ID: W2094101429
cites work: Proofs from THE BOOK
cites work: Q3278733
cites work: Triangulations. Structures for algorithms and applications
cites work: Acute triangulations of polygons
cites work: On Dividing a Square Into Triangles
cites work: Survey of two-dimensional acute triangulations
DOI: 10.1007/S13366-014-0206-6
description: scientific article; zbMATH DE number 6495586