The odd-sided simple polygon intersection bound
Statement
Let and be simple polygons with and sides, respectively, in general position, where are odd. An intersection point is a crossing between a side of and a side of .
Odd-sided intersection bound. There are at most
intersection points between sides of and sides of .
When both numbers of sides are odd, the parity argument gives the weaker upper bound , while the best known construction achieves . The conjecture asserts that this construction is optimal; the status is not established in the supplied source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.