Finding equal-diameter triangulations in polygons

DOI10.1007/S13366-014-0206-6zbMATH Open1332.52003OpenAlexW2094101429WikidataQ56225371 ScholiaQ56225371MaRDI QIDQ747574FDOQ747574

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

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

zbMATH Keywords

triangulationdiameterperimetersimple plane polygon

Mathematics Subject Classification ID

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

Cites Work

• Triangulations. Structures for algorithms and applications
• Survey of two-dimensional acute triangulations
• Title not available (Why is that?)
• Proofs from THE BOOK
• Acute triangulations of polygons
• On Dividing a Square Into Triangles

Cited In (3)

• The dual diameter of triangulations
• Finding equal-diameter tetrahedralizations of polyhedra
• 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)