On the number of intersections of two polygons
We study the maximum possible number of intersections of the boundaries of a simple -gon with a simple -gon in the plane for . To determine the number is quite easy and known when or is even but still remains open for and both odd. We improve (for ) the easy upper bound to and obtain exact bounds for