A few results on the infimum of regular polygons equal-size split line
Yuyang Zhu

TL;DR
This paper investigates the minimal length of a split line dividing a regular polygon into equal parts, providing exact values for specific cases and asymptotic bounds for large m.
Contribution
It derives exact formulas for the minimal split line length in certain cases and establishes asymptotic bounds for large numbers of divisions.
Findings
Exact value of ${l_{2,3}}$ as $ extstyle rac{ ext{sqrt}(rac{ ext{sqrt}3 ext{pi}}{12})}$
Exact value of ${l_{3,3}}$ as $ extstyle rac{ ext{sqrt}3}{2}$
Asymptotic bounds for ${l_{m,n}}/ ext{sqrt}(m)$ as m approaches infinity.
Abstract
If an n-side unit regular polygon is divided into m equal sized parts, then what is the minimum length of the split line ? This problem has its practical application in real world. This paper proved that , , and
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 · graph theory and CDMA systems
