In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time $\omega$, called viewing window. At any time, the user can see only the drawing of the graph induced by the vertices in the viewing window and this determines a sequence of drawings. For readability, we require that all the drawings of the sequence are planar. For preserving the user's mental map we require that when a vertex or an edge is drawn, it has the same drawing for its entire life. We study the problem of drawing the entire sequence by mapping the vertices only to $\omega+k$ given points, where $k$ is as small as possible. We show that: $(i)$ The problem does not depend on the specific set of points but only on its size; $(ii)$ the problem is NP-hard and is FPT when parameterized by $\omega+k$; $(iii)$ there are families of graph stories that can be drawn with $k=0$ for any $\omega$, while for $k=0$ and small values of $\omega$ there are families of graph stories that can be drawn and others that cannot; $(iv)$ there are families of graph stories that cannot be drawn for any fixed $k$ and families of graph stories that require at least a certain $k$.

翻译：在图形故事中,顶端一次输入一个图形,每个顶点在图表中坚持固定时间的固定时间 $\ omega$, 称为查看窗口。 用户可以随时只看到在视图窗口中由顶端引出的图表图图, 这决定了图画的顺序。 在可读性方面, 我们要求序列的所有图图图都是平面的。 为了保存用户的心理地图, 我们要求在绘制顶端或边缘时, 它的整个生命都有相同的图画。 我们通过绘制顶端仅为$\ omega+k$, 以绘制给定的点来研究绘制整个序列的问题, 此时, 用户只能看到由顶端在视图窗口中由顶端引发的图形绘制的图表。 我们显示: $ (i) 问题并不取决于特定的一组点, 仅取决于其大小 ; $(ii) 问题在于 NP- 硬度, 当以 omerga+k美元为参数时, $(iii) 其整个生活都有相同的图片段。 我们研究如何用 $=0美元绘制整个家庭, 而该图表不能以美元 美元 美元 美元 或其它 美元 美元 。