English: This diagram llustrates the process of partitioning an irregular polygon into a series of convex ones by binary space partitioning. Notice how each step produces polygons with fewer segments until arriving at G and F, which are convex and require no further partitioning. In this particular case, the partitioning line was picked between existing vertices of the polygon and intersected none of its segments.