@article{Didimo2007OverlappingCP,
title={Overlapping cluster planarity},
author={Walter Didimo and Francesco Giordano and Giuseppe Liotta},
journal={2007 6th International Asia-Pacific Symposium on Visualization},
year={2007},
pages={73-80}
}

Cluster planarity is currently recognized as one of the most interesting problem in graph drawing. This paper investigates a new direction in this area by addressing the following question: let G be a graph along with a hierarchy of vertex clusters, where clusters can partially intersect. Does G admit a drawing where each cluster is inside a simple closed region, no two edges intersect, and no edge intersects a region twice? We investigate the interplay between this problem and the classical… CONTINUE READING