Constructing Non-Overlapping Fractal Attractors from Weakly Separated Self-Similar Sets

Weakly separated self-similar sets can be represented as graph-directed fractal constructions obeying the open set condition, through a combinatorial algorithm that eliminates overlaps.