Abstract 1 Introduction 2 Preliminaries 3 Geometry Matters in Planar Storyplans 4 NP-hardness 5 Conclusion References

Geometry Matters in Planar Storyplans

Alexander Dobler ORCID TU Wien, Austria Maximilian Holzmüller TU Wien, Austria Martin Nöllenburg ORCID TU Wien, Austria
Abstract

A storyplan visualizes a graph G=(V,E) as a sequence of frames Γ1,,Γ, each of which is a drawing of the induced subgraph G[Vi] of a vertex subset ViV. Moreover, each vertex vV is contained in a single consecutive sequence of frames Γi,,Γj, all vertices and edges contained in consecutive frames are drawn identically, and the union of all frames is a drawing of G. In GD 2022, the concept of planar storyplans was introduced, in which each frame must be a planar (topological) drawing. Several (parameterized) complexity results for recognizing graphs that admit a planar storyplan were provided, including 𝖭𝖯-hardness. In this paper, we investigate an open question posed in the GD paper and show that the geometric and topological settings of the planar storyplan problem differ: We provide an instance of a graph that admits a planar storyplan, but no planar geometric storyplan, in which each frame is a planar straight-line drawing. Still, by adapting the reduction proof from the topological to the geometric setting, we show that recognizing the graphs that admit planar geometric storyplans remains 𝖭𝖯-hard.

Keywords and phrases:
geometric storyplan, planarity, straight-line drawing, dynamic graph drawing
Funding:
Alexander Dobler: Vienna Science and Technology Fund (WWTF) grant [10.47379/ICT19035].
Martin Nöllenburg: Vienna Science and Technology Fund (WWTF) grant [10.47379/ICT19035].
Copyright and License:
[Uncaptioned image] © Alexander Dobler, Maximilian Holzmüller, and Martin Nöllenburg; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Theory of computation Computational geometry
; Mathematics of computing Graph theory ; Human-centered computing Graph drawings
Related Version:
Full Version: https://arxiv.org/abs/2508.12747 [13]
Based on Maximilian Holzmüller’s master thesis: https://repositum.tuwien.at/handle/20.500.12708/213348 [16]
Editors:
Vida Dujmović and Fabrizio Montecchiani

1 Introduction

Planar storyplans, introduced in 2022 [4], represent an approach to draw possibly dense and non-planar graphs as a sequence of 1 planar subdrawings called frames. In addition to the planarity condition for each frame, their sequence must satisfy certain visual consistency criteria in order to be a valid planar storyplan: (i) each vertex belongs to a single, non-empty interval of frames, (ii) each frame shows the subgraph induced by the vertices of the frame, (iii) the shared vertices and edges of any two consecutive frames have the same geometric representation, and (iv) every edge must be visible in at least one frame, i.e., the incident vertices of every edge must co-occur in some frame. Storyplans belong to the class of gradual graph visualizations, which depict a graph in a sequential story-like or unordered small-multiples fashion. The goal of such gradual visualizations is to show a complex graph G as a collection of simpler drawings, e.g., planar drawings of subgraphs whose union represents G. Identical vertices and edges in the individual subdrawings can be mentally linked by requiring that they are always drawn the same if they occur in multiple subdrawings. Such visualizations find applications both for visualizing dynamic graphs [1, 17], in which vertices and edges occur over time, and for graphs that are decomposed into multiple simpler subgraphs without a sequential order [11, 12]. Storyplans with their temporal sequence of frames are related to drawing graphs in a streaming model. In the storyplan problem, however, one can choose the sequence in which vertices enter and leave the story, whereas this sequence is part of the input in streaming models [8, 2, 3, 15] and in graph stories [9, 7, 6, 10].

The authors of [4, 5] investigated the complexity of deciding whether a given graph admits a planar storyplan in a topological setting, with edges drawn as simple curves between their endpoints. They showed 𝖭𝖯-completeness and fixed-parameter tractability parameterized by the vertex cover number or the feedback edge set number of the graph. Furthermore, they proved that every graph of treewidth at most 3 admits a planar storyplan, and that such a planar storyplan (actually with straight-line edges) can be computed in linear time. In [14] the investigation of storyplans was extended to outerplanar and forest storyplans, in which each frame is not just planar, but actually outerplanar or a forest. They proved a strict containment relation between forest, outerplanar, and planar storyplans and identified graph families that do or do not always admit these storyplans. In the affirmative case, their storyplans use straight-line edges.

In this paper, we investigate an open question by several authors [4, 5] and explore the differences between planar (topological) storyplans and planar geometric storyplans. Obviously, every graph that admits a planar geometric storyplan also admits a planar storyplan. We prove that the converse is not true by providing a counterexample of a graph with 28 vertices that admits a planar storyplan, but none with straight-line edges. The main challenge in our geometric construction is to enforce an obstruction to straight-line visibility for any possible placement of the vertices and for any possible vertex-to-frame assignment. As a second result, we adapt the hardness proof of from [4, 5] to establish that deciding if a given graph admits a planar geometric storyplan remains 𝖭𝖯-hard.

2 Preliminaries

For n, we use [n]={1,2,,n} as a shorthand. For ab, we define [a,b]={a,a+1,,b}. For a graph G, let V(G) be its vertex set and let E(G) be its edge set. For VV(G), G[V] is the subgraph of G induced by V. Given an induced subgraph G of some graph G, and a vertex of G not contained in V(G), G+v is defined as G[V(G){v}]. We denote by uv the edge {u,v} connecting vertices u and v.

The storyplan problem.

A storyplan of a graph G on time steps [], , consists of a pair (A,𝒟). For each vV(G), A(v)=[sv,ev][] is the visible interval of v. We say that v appears at sv, is visible at each sv,sv+1,,ev, and disappears after ev. It must hold for a pair of adjacent vertices u,vV that A(u)A(v), i.e., there is a time step in which the edge uv can be drawn. We say in this case that u and v co-occur. For each t[], G[t]=G[{vVtA(v)}] is the frame graph at t. For a subgraph G of G, we say that G is visible at t if all of its vertices are visible. The drawing function 𝒟 represents a drawing 𝒟(v) of each vertex vV(G) and drawing 𝒟(e) of each edge eE(G). Further, for each subgraph G of G, 𝒟(G) is the drawing of G, i.e., the drawing function is applied to each vertex and edge of G. For each t[], we call Γt:=𝒟(G[t]) the frame at t. For a storyplan, it must hold that each frame represents a simple drawing of the corresponding induced subgraph. A storyplan is planar if each frame corresponds to a planar drawing. A storyplan is geometric (or straight-line) planar if each frame corresponds to a planar drawing such that each edge is represented by a straight-line segment.

We consider the following two problems.

Problem 1.

Given a graph G, does G admit a planar storyplan?

Problem 2.

Given a graph G, does G admit a planar geometric storyplan?

Note that these definitions are slightly different from those in [5]. There, each vertex appears in a unique frame, while we permit multiple vertices appearing in a single frame. It is easy to see, though, that these two definitions are equivalent with regard to the existence of a planar (geometric) storyplan for a given graph G.

3 Geometry Matters in Planar Storyplans

In this section, we show our following main result.

Theorem 1.

There is a graph that admits a planar storyplan and that does not admit a planar geometric storyplan.

The graph G is defined as follows. It consists of three four-cycles A, B, and C with vertices ai,bi,ci, i[4] and edges eiA=aiaimod4+1, eiB=bibimod4+1, and eiC=cicimod4+1 for i[4]. Furthermore, the graph contains eight apex vertices qij, i[4],j[2], such that each qij is connected to all vertices of A, B, and C. Lastly, eight more edge vertices rij, i[4],j[2] are added. Each rij is connected to qij and to all vertices from eiA,eiB, and eiC.

We define Q={qiji[4],j[2]} and R={riji[4],j[2]}. For each i[4] and j[2], Pij={qij,rij} is an apex-pair.

Below, we give a formal definition of G. Further, the graph can also be parsed from one of its planar storyplans in Figure 1.

V(G)= {ai,bi,cii[4]}{qij,riji[4],j[2]}
E(G)= {aiaimod4+1,bibimod4+1,cicimod4+1i[4]}{rijqiji[4],j[2]}
{rijai,rijaimod4+1,ribi,ribimod4+1,rijci,rijcimod4+1i[4],j[2]}
{qijak,qijbk,qijcki,k[4],j[2]}

We prove both statements of Theorem 1 in the following two sections.

3.1 𝑮 Has a Planar Storyplan

Figure 1: A planar storyplan for the graph G with eight frames. Frames k and k+4 show the same drawing for each k[4]. For frames 1,2,3,4, j=1; for frames 5,6,7,8, j=2.

A planar storyplan of G with eight frames Γ1,,Γ8 is given in Figure 1. The four-cycles A, B, C are visible in all frames. Each apex-pair qij,rij for i[4] and j[2] is visible only in frame Γ(j1)4+i. As the neighborhoods of apex pairs qi1,ri1 and qi2,ri2, i[4], w.r.t. the four-cycles are the same, they can be represented by the same drawing. This is why we show only four drawings in the figure.

3.2 𝑮 Does Not Have a Planar Geometric Storyplan

This section serves the purpose of showing the following.

Theorem 2.

The graph G does not admit a planar geometric storyplan.

We proceed to assume that G admits a planar geometric storyplan (A,𝒟), and we will arrive at a contradiction. We require a sequence of lemmas that will lead to this contradiction.

Lemma 3.

Let I={A(qij)qijQ} be the visible intervals of the vertices in Q. Then there exists a set II of cardinality at least 6, such that for all [s,e]I and all t[s,e], A, B, and C are visible at t.

Proof.

First, there is a time step in which all cycle vertices from a single cycle, say A, are visible. Otherwise, consider the time step eA after which the first cycle vertex of A, say a1, disappears, yet a3 has not yet appeared. Then, in eA, the three cycle vertices a1,a2,a4 of A and all eight apex vertices must be visible since they need to see both a1 and a3; they induce a non-planar K3,8, contradicting that every frame is planar. This holds analogously for the cycles B,C. Secondly, there is a time step in which all cycle vertices of all three cycles are visible. Otherwise, consider the time step after which the first cycle vertex disappears. Again, at this time step, we have at least a non-planar K4,8 by the same argumentation that the apex vertices need to see both the disappearing cycle vertex and at least one cycle vertex that has not yet appeared.

Now sort the intervals in I by their start points. Consider the first two intervals [s,e],[s,e] in this order. Let q and q be their respective apex-vertices. We show that [s,e][s,e]=. By our previous arguments, there is a time step t[s,e] in which q and all cycle vertices are visible. If sse, then there is furthermore a time step t with ste, such that q, q, and all cycle vertices are visible. Notice that this amounts to 14 vertices and 36 edges. Further, the induced drawing of the four-cycles and the two apex-vertices must clearly have a face incident to four vertices – four vertices of one of the four-cycles. Adding a chord, keeping the structure planar, we would end up with 14 vertices and 37 edges, a contradiction to Euler’s formula. Symmetrically, by considering the last two intervals when sorted by their end points, we also see that their intersection is empty. The statement follows directly, as each apex must co-occur with each cycle-vertex.

Corollary 4.

There exist at least 6 frames, each containing a different apex pair and all four-cycles.

Lemma 5.

There exists a pair from {A,B,C} that is not nested, i.e., in the drawing of only these two four-cycles, the outer face is incident to all vertices.

Proof.

This follows directly from Lemma 3, as there exists a frame with some apex vertex and all three four-cycles. Clearly, the statement holds, as there is otherwise no face (in the induced drawing of A, B, and C) that contains all four-cycle vertices. In the remainder of the proof, we assume that A and B form a non-nested pair.

Next, we want to define one of the drawings of A or B to be “smaller”, see Figure 2. This will be useful in showing that for one of the four-cycles A and B, in the drawing of this four-cycle plus an apex-vertex, the other four-cycle will always lie on the outer face.

Figure 2: The two cases of a D1D2. In the second case, the point x is closer to D1 than to D2.
Definition 6.

Consider two simple quadrilaterals D1 and D2, such that the outer face is incident to all eight vertices. Define D1D2 if one of the following conditions holds.

  1. 1.

    D1 is contained within the convex hull of D2.

  2. 2.

    The convex hull of D1D2 contains two non-parallel line segments s and s each connecting a point from D1 with a point from D2. Let x be the intersection point of the supporting lines of s and s. Point x is closer to D1 than to D2 (in terms of the classic definition between a point and the set of points defined by the inside region of the quadrilateral).

It is clear that we cannot have D1D2 and D2D1. It can, however, be that we have neither. As the drawings of A, B, and C correspond to simple quadrilaterals, we can show the following lemma (refer to Figure 3 for an illustration). Note that the statement makes sense, as A and B share the outer face.

Figure 3: 𝒟(A)𝒟(B) is implied by A lying inside of one of the faces of the drawing of A+qij.
Lemma 7.

Let F be a frame containing an apex pair Pij and all four-cycles. We have that 𝒟(A)𝒟(B) if 𝒟(A) is contained within an inner face of 𝒟(B+qij). Equivalently, 𝒟(B)𝒟(A) if 𝒟(B) is contained within an inner face of 𝒟(A+qij).

Proof.

Assume that 𝒟(A) is contained within an inner face of 𝒟(B+qij). For the frame F, consider the drawing induced by qij, A, and B. Consider the edges on the outer face of this drawing. Two of these connect a vertex of B with qij; we denote these vertices as b and b. Now, either A is contained within the convex hull of B, or the convex hull of A+B contains two line segments s and s, each connecting a vertex of A with a vertex of B. In the former case, 𝒟(A)𝒟(B) is immediate. In the latter case, s and s are contained within the triangle defined by b, b, and qij. Now notice that, if the intersection point of the lines defined by s and s was closer to 𝒟(B) than to 𝒟(A), or if s and s were parallel, the points on s and s which are vertices of B would not be visible from qij. Hence, we have 𝒟(A)𝒟(B). As we cannot have both 𝒟(A)𝒟(B) and 𝒟(B)𝒟(A), we assume, w.l.o.g., that 𝒟(B)𝒟(A). Thus, in any frame containing A, B, and some apex vertex qij, B will lie on the outer face of the drawing defined by A and qij.

We will now show the last ingredient, which can be seen as the key lemma of the construction. Essentially, we want to show that at most two edges of A are “good” – in the sense that they can lie on the outer face of the drawing of A plus some apex vertex (see Figure 4b). More formally, for a fixed drawing of A, the edge ekA, k[4], is good if it can be the edge on the outer face of the planar straight-line drawing 𝒟(A+qij) for some possible placement of some apex vertex qij in the outer face of 𝒟(A). We show the following.

Figure 4: (a) The half-planes defined by 𝒟(A), an apex vertex must lie in a specific intersection of half-planes. (b) A convex and concave drawing of A with exactly two good edges.
Lemma 8.

For a fixed drawing 𝒟(A) of A, A has at most two good edges.

Proof.

The proof distinguishes two cases, depending on whether 𝒟(A) is convex or not. We start with the convex case. We show that it is not possible that e1A and e3A are both good. By symmetry, this means that e2A and e4A cannot be both good, and the statement follows. Thus, assume that e1A and e3A are good. We observe that in the drawing of A, each edge defines two open half-planes – the “outer half-plane” and the “inner half-plane” (see Figure 4a for the outer half-planes). More precisely, the outer half-plane defined by eiA contains as subset the points which can be connected by straight lines to ai and ai(mod4)+1 without crossings, while the inner half plane does not. Thus, for k[4], define HkO as the outer half-plane defined by ekA, and HkI as the inner half-plane. As the half-planes are open, they do not contain the line defined by their corresponding edge. Since e1 is good, H1IH2OH3OH4O is non-empty (an apex vertex must be able to lie in this region for the drawing to be straight-line planar and for the edge e1A to be on the outer face). Similarly, as e3 is good H1OH2OH3IH4O is non-empty. Note that H2OH4O is disjoint from the inner region defined by 𝒟(A). For H1O and H1I to both share points with the intersection of H2O and H4O, the line defined by the drawing of e1A must pass through H2OH4O. Because the drawing of A is convex, and because H2OH4O does not share points with the region defined by 𝒟(A), this is not possible. We obtain a contradiction.

For the concave case, w.l.o.g., assume that the concave corner is at a2, with its two incident edges e1A and e2A. We claim that none of e1A and e2A can be good. For e1A to be good, we again have that H1IH2OH3OH4O is non-empty. This is not possible: Consider any point x outside 𝒟(A) and in H1I. Notice that the line segment from x to a2 intersects an edge of A. Hence, e1A cannot be good. The proof that e2 cannot be good proceeds equivalently.

Proof of Theorem 2.

Assume for a contradiction that G admits a planar geometric storyplan. By our assumption, the drawings of A and B are in each other’s outer face. Further 𝒟(B)𝒟(A) does not hold. Thus, in each of the six frames existing by Corollary 4, 𝒟(B) is in the outer face of the drawing induced by A and the apex vertex. For the frame to be planar, the edge vertex of the apex-pair must be on the outer face of the drawing induced by the apex and A. Hence, the edge vertex must be connected with a good side of A. But, as there are only two good sides (Lemma 8), this is only possible for at most four apex-pairs. Hence, two of the edge vertices of the six apex pairs of Corollary 4 cannot be connected to a good side of A, a contradiction.

4 NP-hardness

Furthermore, we can show that Problem 2 remains 𝖭𝖯-hard.

Theorem 9.

Deciding whether a graph admits a planar geometric storyplan is 𝖭𝖯-hard.

Essentially, we apply the same reduction from a variant of SAT as in [5]. Since every planar geometric storyplan is a planar storyplan, we get one direction of the correctness proof for free. However, we have to construct a geometric planar storyplan for every satisfying assignment. This requires a new construction, as the one in [5] does not use straight-line edges. For details, refer to the full version [13].

5 Conclusion

We have shown that not all graphs that admit a planar storyplan also admit a planar geometric storyplan, yet the decision problem remains 𝖭𝖯-hard. A natural open question is whether the problem remains in 𝖭𝖯, or whether it is complete for some other complexity class, such as .

For further open problems on storyplans in general, we refer to those given in [5] and [14].

References

  • [1] Fabian Beck, Michael Burch, Stephan Diehl, and Daniel Weiskopf. The state of the art in visualizing dynamic graphs. In Rita Borgo, Ross Maciejewski, and Ivan Viola, editors, EuroVis 2014. Eurographics Association, 2014. doi:10.2312/eurovisstar.20141174.
  • [2] Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, and Katharina Anna Zweig. Drawing trees in a streaming model. In David Eppstein and Emden R. Gansner, editors, Proc. Graph Drawing and Network Visualization (GD’09), volume 5849 of Lecture Notes in Computer Science, pages 292–303. Springer, 2009. doi:10.1007/978-3-642-11805-0_28.
  • [3] Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, and Katharina Anna Zweig. Drawing trees in a streaming model. Inf. Process. Lett., 112(11):418–422, 2012. doi:10.1016/j.ipl.2012.02.011.
  • [4] Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, and Antonios Symvonis. On the complexity of the storyplan problem. In Patrizio Angelini and Reinhard von Hanxleden, editors, Proc. Graph Drawing and Network Visualization (GD’22), volume 13764 of Lecture Notes in Computer Science, pages 304–318. Springer, 2022. doi:10.1007/978-3-031-22203-0_22.
  • [5] Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, and Antonios Symvonis. On the complexity of the storyplan problem. J. Comput. Syst. Sci., 139:103466, 2024. doi:10.1016/J.JCSS.2023.103466.
  • [6] Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, and Maurizio Patrignani. Graph stories in small area. J. Graph Algorithms Appl., 24(3):269–292, 2020. doi:10.7155/jgaa.00530.
  • [7] Manuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati, and Maurizio Patrignani. Graph stories in small area. In Daniel Archambault and Csaba D. Tóth, editors, Proc. Graph Drawing and Network Visualization (GD’19), volume 11904 of Lecture Notes in Computer Science, pages 545–558. Springer, 2019. doi:10.1007/978-3-030-35802-0_41.
  • [8] Giordano Da Lozzo and Ignaz Rutter. Planarity of streamed graphs. Theor. Comput. Sci., 799:1–21, 2019. doi:10.1016/J.TCS.2019.09.029.
  • [9] Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, and Alessandra Tappini. Small point-sets supporting graph stories. In Patrizio Angelini and Reinhard von Hanxleden, editors, Proc. Graph Drawing and Network Visualization (GD’22), volume 13764 of Lecture Notes in Computer Science, pages 289–303. Springer, 2022. doi:10.1007/978-3-031-22203-0_21.
  • [10] Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, and Alessandra Tappini. Small point-sets supporting graph stories. J. Graph Algorithms Appl., 27(8):651–677, 2023. doi:10.7155/JGAA.00639.
  • [11] Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, and Ioannis G. Tollis. Exploring complex drawings via edge stratification. In Stephen K. Wismath and Alexander Wolff, editors, Proc. Graph Drawing and Network Visualization (GD’13), volume 8242 of Lecture Notes in Computer Science, pages 304–315. Springer, 2013. doi:10.1007/978-3-319-03841-4_27.
  • [12] Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, and Ioannis G. Tollis. Techniques for edge stratification of complex graph drawings. J. Vis. Lang. Comput., 25(4):533–543, 2014. doi:10.1016/j.jvlc.2014.05.001.
  • [13] Alexander Dobler, Maximilian Holzmüller, and Martin Nöllenburg. Geometry matters in planar storyplans. CoRR, abs/2508.12747, 2025. arXiv:2508.12747.
  • [14] Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, and Johannes Zink. Outerplanar and forest storyplans. In Henning Fernau, Serge Gaspers, and Ralf Klasing, editors, Proc. Theory and Practice of Computer Science (SOFSEM’24), volume 14519 of Lecture Notes in Computer Science, pages 211–225. Springer, 2024. doi:10.1007/978-3-031-52113-3_15.
  • [15] Michael T. Goodrich and Pawel Pszona. Streamed graph drawing and the file maintenance problem. In Stephen K. Wismath and Alexander Wolff, editors, Proc. Graph Drawing and Network Visualization (GD’13), volume 8242 of Lecture Notes in Computer Science, pages 256–267. Springer, 2013. doi:10.1007/978-3-319-03841-4_23.
  • [16] Maximilian Holzmüller. Expanding the planar storyplan problem. Master’s thesis, Technische Universität Wien, 2025. URL: https://repositum.tuwien.at/handle/20.500.12708/213348.
  • [17] Corinna Vehlow, Fabian Beck, and Daniel Weiskopf. Visualizing dynamic hierarchies in graph sequences. IEEE Trans. Vis. Comput. Graph., 22(10):2343–2357, 2016. doi:10.1109/TVCG.2015.2507595.