circle cutting | pancake cutting | pie cutting

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The minimum number is always n + 1, where n is the number of cuts, and it is always possible to obtain any number of pieces between the minimum and maximum. The first cut creates 2 regions, and the nth cut creates n new regions, so f(1) | = | 2 f(2) | = | 2 + f(1) f(n) | = | n + f(n - 1).

circle division by chords | plane division by circles | plane division by ellipses | plane division by lines | space division by planes | space division by spheres | square division by lines