Intersections of Odd Polygons Revisited
It is shown that the maximum number of intersection points between the boundaries of a simple $m$-gon and a simple $n$-gon is $mn-(m+n)+3$ for any odd integers $m,n \ge 3$. The previous best upper bound was $mn-(m+n)+C$, for some huge constant $C$.
Authors
- Eyal Ackerman (ORCID: https://orcid.org/0000-0002-2912-7772)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24343
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- preprint