This is an efficient algorithm to calculate the areas
of the tiles in the Dirichlet-Voronoi tessellation.
If the window of X is a binary pixel mask, the
tile areas are computed by counting pixels. Otherwise the
areas are computed exactly using analytic geometry.
If any points of X are duplicated, the duplicates will
have tile area zero.