  Suppose that a biconnected graph is given, consisting of a large component
plus several other smaller components, each separated from the main component
by a separation pair. We investigate the existence and the computation time of
schematic representations of the structure of such a graph where the main
component is drawn as a disk, the vertices that take part in separation pairs
are points on the boundary of the disk, and the small components are placed
outside the disk and are represented as non-intersecting lunes connecting their
separation pairs. We consider several drawing conventions for such schematic
representations, according to different ways to account for the size of the
small components. We map the problem of testing for the existence of such
representations to the one of testing for the existence of suitably constrained
$1$-page book-embeddings and propose several polynomial-time algorithms.
