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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Intersections of Odd Polygons Revisited

Eyal Ackerman
arXiv (Cornell University)
Computational Geometry and Mesh Generation
preprint

Intersections of Odd Polygons Revisited

Eyal Ackerman
preprint en

Abstract

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$.

arXiv (Cornell University)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon