2000 character limit reached
The maximum number of intersections of two polygons (1207.0996v2)
Published 4 Jul 2012 in math.CO and cs.DM
Abstract: We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p and q are both odd and both polygons are simple, the problem is more difficult. The conjectured maximum is (p-1)(q-1)+2 for all odd p and q.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.