Finding equal-diameter triangulations in polygons

DOI10.1007/S13366-014-0206-6MaRDI QIDQ747574zbMATH OpenOpenAlexWikidataFDO

Authors A. Bezdek, T. Bisztriczky

Publication date 16 October 2015

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

Full work available at URL https://doi.org/10.1007/s13366-014-0206-6

zbMATH Keywords

diameterperimetersimple plane polygontriangulation

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

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.

Recommendations

• Finding equal-diameter tetrahedralizations of polyhedra
• The dual diameter of triangulations
• On compatible triangulations of simple polygons
• On the minimality of polygon triangulation
• Dissections into equilateral triangles

Cites work

• Acute triangulations of polygons
• scientific article; zbMATH DE number 3160754 (Why is no real title available?)
• On Dividing a Square Into Triangles
• Proofs from THE BOOK
• Survey of two-dimensional acute triangulations
• Triangulations. Structures for algorithms and applications

Cited in

(4)

• The dual diameter of triangulations
• Finding equal-diameter tetrahedralizations of polyhedra
• Twistor spaces and harmonic maps
• Triangle-Free Partitions of Euclidean Space

This page was built for publication: Finding equal-diameter triangulations in polygons

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