TL;DR
This paper explores the problem of identifying maximum and minimum inscribed polygons within equilateral triangles, revealing unexpected findings in a classical geometric optimization problem.
Contribution
It extends previous work by focusing on equilateral triangles and uncovers surprising results in inscribed polygon optimization.
Findings
Identification of extremal polygons in equilateral triangles
Discovery of unexpected geometric properties
New bounds for inscribed polygons
Abstract
In this paper we continue the investigation of finding the max/min polygons which can be inscribed in a given triangle. Here we are concerned with equilateral triangles. This may seem uninteresting or benign at first, but there are some surprises later.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Computational Geometry and Mesh Generation · History and Theory of Mathematics