An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons

Abstract

What is the maximum number of intersections of the boundaries of a simple m-gon and a simple n-gon, assuming general position? This is a basic question in combinatorial geometry, and the answer is easy if at least one of m and n is even. If both m and n are odd, the best known construction has mn-(m+n)+3 intersections, and it is conjectured that this is the maximum. However, the best known upper bound is only mn-(m + ? n/6 ?), for m ? n. We prove a new upper bound of mn-(m+n)+C for some constant C, which is optimal apart from the value of C