  We study the problem of gradually representing a complex graph as a sequence
of drawings of small subgraphs whose union is the complex graph. The sequence
of drawings is called \emph{storyplan}, and each drawing in the sequence is
called a \emph{frame}. In an outerplanar storyplan, every frame is outerplanar;
in a forest storyplan, every frame is acyclic. We identify graph families that
admit such storyplans and families for which such storyplans do not always
exist. In the affirmative case, we present efficient algorithms that produce
straight-line storyplans.
