Optimal Embedded and Enclosing Isosceles Triangles

DOI10.1142/S012905412342008XMaRDI QIDQ6066459zbMATH OpenWikidataFDO

Authors Mónika Csikós, Gergely Kiss, János Pach, Gábor Somlai

Publication date 16 November 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2205.11637

zbMATH Keywords

isosceles triangleminimal coverspecial container

Mathematics Subject Classification ID

Length, area and volume in real or complex geometry (51M25)

Abstract: Given a triangle $Delta$, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of $Delta$ with respect to area and perimeter. This problem was initially posed by Nandakumar and was first studied by Kiss, Pach, and Somlai, who showed that if $Delt{a}^{\prime }$ is the smallest area isosceles triangle containing $Delta$, then $Delt{a}^{\prime }$ and $Delta$ share a side and an angle. In the present paper, we prove that for any triangle $Delta$, every maximum area isosceles triangle embedded in $Delta$ and every maximum perimeter isosceles triangle embedded in $Delta$ shares a side and an angle with $Delta$. Somewhat surprisingly, the case of minimum perimeter enclosing triangles is different: there are infinite families of triangles $Delta$ whose minimum perimeter isosceles containers do not share a side and an angle with $Delta$.

Recommendations

• ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
• Isoperimetrically optimal polygons in the triangular grid
• An optimal algorithm for finding minimal enclosing triangles
• On polyhedral realization with isosceles triangles
• Isoperimetric triangular enclosures with a fixed angle
• An extremal problem for inscribed triangles
• On a covering problem for equilateral triangles
• On the optimality of Napoleon triangles

Cites work

• Can you cover your shadows?
• Circumscribed polygons of small area
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Convex disks can cover their shadow
• Equilateral Triangles and Triangles
• Finding Extremal Polygons
• Finding minimal enclosing boxes
• Geometric algorithms and combinatorial optimization
• Geometry. I, II. Transl. from the French by M. Cole and S. Levy
• scientific article; zbMATH DE number 3160756 (Why is no real title available?)
• scientific article; zbMATH DE number 3083197 (Why is no real title available?)
• Implementation of linear minimum area enclosing triangle algorithm. Application note
• Largest triangles in a polygon
• Maximum-area triangle in a convex polygon, revisited
• Minimum-Area ellipse containing a finite set of points. II
• Minimum-area enclosing triangle with a fixed angle
• Minimum-volume enclosing ellipsoids and core sets
• On minimum circumscribed polygons
• On the minimal volume of simplices enclosing a convex body
• On the regularity of the growth of the modulus and argument of an entire function in the metric of L p [0, 2π]
• On Triangles Circumscribing Plane Convex Sets
• One hundred problems in elementary mathematics. With a foreword by Martin Gardner
• Triangle in a triangle: On a problem of Steinhaus

Cited in

(2)

• ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
• Isoperimetric triangular enclosures with a fixed angle

This page was built for publication: Optimal Embedded and Enclosing Isosceles Triangles

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