Prof. Ramesh Krishnamurti developed in 1978 a discrete dissection algorithm based on coloring. Instead of dividing a form or tiling predefined rooms, a very efficient method to address dissection is defined by assigning imaginary colors to the grid that represents the floor plan. A resulting cluster with tiles with the same color represent a specific room in the spatial arrangement. The challenge of coloring is to make sure that the geometric and topological constraints are respected – it is a constraint satisfaction search. For this reason, coloring follows a specific set of rules.