In a plane, we have a convex polygon with n sides. What would be the maximum number of disconnected pieces / fragments if this polygon is clipped against a square?
Finding the maximum number of disconnected fragments
polygon