We will present two versions of the "Ham sandwich theorem", one for
bounded open sets in R^n and one for finite sets.

These versions allow for "cutting" multiple sets with zeroes of
polynomials (varieties).

As a consequence we will obtain the cell decomposition theorem that,
given a collection of points, allows cutting R^n using polynomials into
cells containing a controlled number of points.