Skip to main content
SpringerLink
Log in

Outerplanar and Forest Storyplans

  • Conference paper
  • First Online:
SOFSEM 2024: Theory and Practice of Computer Science (SOFSEM 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14519))

  • 106 Accesses

Abstract

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 , and each drawing in the sequence is called a . 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abdelaal, M., Lhuillier, A., Hlawatsch, M., Weiskopf, D.: Time-aligned edge plots for dynamic graph visualization. In: Banissi, E., et al. (eds.) Proceedings of 24th International Conference Information Visualisation (IV 2020), pp. 248–257 (2020). https://doi.org/10.1109/IV51561.2020.00048

  2. Been, K., Nöllenburg, M., Poon, S.-H., Wolff, A.: Optimizing active ranges for consistent dynamic map labeling. Comput. Geom. 43(3), 312–328 (2010). https://doi.org/10.1016/j.comgeo.2009.03.006

    Article  MathSciNet  Google Scholar 

  3. Binucci, C., et al.: Drawing trees in a streaming model. Inf. Process. Lett. 112(11), 418–422 (2012). https://doi.org/10.1016/j.ipl.2012.02.011

    Article  MathSciNet  Google Scholar 

  4. Binucci, C., et al.: On the complexity of the storyplan problem. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022. LNCS, vol. 13764, pp. 304–318. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-22203-0_22. https://arxiv.org/abs/2209.00453

  5. Borrazzo, M., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Graph stories in small area. J. Graph Algorithms Appl. 24(3), 269–292 (2020). https://doi.org/10.7155/jgaa.00530

    Article  MathSciNet  Google Scholar 

  6. Burch, M.: The dynamic graph wall: visualizing evolving graphs with multiple visual metaphors. J. Vis. 20(3), 461–469 (2017). https://doi.org/10.1007/s12650-016-0360-z

    Article  Google Scholar 

  7. Da Lozzo, G., Rutter, I.: Planarity of streamed graphs. Theor. Comput. Sci. 799, 1–21 (2019). https://doi.org/10.1016/j.tcs.2019.09.029

    Article  MathSciNet  Google Scholar 

  8. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990). https://doi.org/10.1007/BF02122694

    Article  MathSciNet  Google Scholar 

  9. Di Battista, G., et al.: Small point-sets supporting graph stories. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022. LNCS, vol. 13764, pp. 289–303. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-22203-0_21. https://arxiv.org/abs/2208.14126

  10. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Hoboken (1999)

    Google Scholar 

  11. Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. Algorithmica 54(1), 25–53 (2009). https://doi.org/10.1007/11618058_9

    Article  MathSciNet  Google Scholar 

  12. Fiala, J., Firman, O., Liotta, G., Wolff, A., Zink, J.: Outerplanar and forest storyplans. arXiv report (2023). http://arxiv.org/abs/2311.13523

  13. Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417–427 (1983). https://doi.org/10.1145/2402.322385

    Article  MathSciNet  Google Scholar 

  14. Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of 1st ACM-SIAM Symposium Discrete Algorithms (SODA 1990), pp. 138–148 (1990). https://dl.acm.org/doi/10.5555/320176.320191

Download references

Author information

Authors and Affiliations

  1. Charles University, Prague, Czech Republic

    Jiří Fiala

  2. Universität Würzburg, Würzburg, Germany

    Oksana Firman, Alexander Wolff & Johannes Zink

  3. Università degli Studi di Perugia, Perugia, Italy

    Giuseppe Liotta

Authors
  1. Jiří Fiala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oksana Firman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giuseppe Liotta
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexander Wolff
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Johannes Zink
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oksana Firman .

Editor information

Editors and Affiliations

  1. University of Trier, Trier, Germany

    Henning Fernau

  2. UNSW Sydney, Sydney, NSW, Australia

    Serge Gaspers

  3. CNRS and University of Bordeaux, Talence, France

    Ralf Klasing

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fiala, J., Firman, O., Liotta, G., Wolff, A., Zink, J. (2024). Outerplanar and Forest Storyplans. In: Fernau, H., Gaspers, S., Klasing, R. (eds) SOFSEM 2024: Theory and Practice of Computer Science. SOFSEM 2024. Lecture Notes in Computer Science, vol 14519. Springer, Cham. https://doi.org/10.1007/978-3-031-52113-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-52113-3_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-52112-6

  • Online ISBN: 978-3-031-52113-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation