Morphing Planar Graph Drawings Through 3D

Authors

  • Kevin Buchin TU Dortmund University image/svg+xml
  • Will Evans University of British Columbia image/svg+xml
  • Fabrizio Frati Roma Tre University image/svg+xml
  • Irina Kostitsyna TU Eindhoven
  • Maarten Löffler Utrecht University image/svg+xml
  • Tim Ophelders Utrecht University and TU Eindhoven
  • Alexander Wolff Universität Würzburg

DOI:

https://doi.org/10.57717/cgt.v2i1.33

Abstract

In this paper, we investigate crossing-free 3D morphs between planar straight-line drawings. We show that, for any two (not necessarily topologically equivalent) planar straight-line drawings of an n-vertex planar graph, there exists a piecewise-linear crossing-free 3D morph with O(n2) steps that transforms one drawing into the other. We also give some evidence why it is difficult to obtain a linear lower bound (which exists in 2D) for the number of steps of a crossing-free 3D morph.

Downloads

Published

2023-09-22

Issue

Section

Original Research Articles

Categories

How to Cite

Morphing Planar Graph Drawings Through 3D (K. Buchin, W. Evans, F. Frati, I. Kostitsyna, M. Löffler, T. Ophelders, & A. Wolff, Trans.). (2023). Computing in Geometry and Topology, 2(1), 5:1-5:18. https://doi.org/10.57717/cgt.v2i1.33