Why do we have to partition non-convex polygons into convex polygons in a map in Binary Space Partitioning?
Because with 2 non-overlapping convex polygons you can always say that 1 polygon is closer to a point than another.

If they are not convex then for example with a U surrounding a circle. You cannot say easily which should be drawn first.