Morphing Planar Graph Drawings via Orthogonal Box Drawings
Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson

TL;DR
This paper presents an efficient algorithm for morphing planar graph drawings into orthogonal box drawings, enabling planarity-preserving transformations with small grid size and a constant number of bends per edge.
Contribution
It introduces a novel morphing algorithm that transforms planar graph drawings into orthogonal box drawings with controlled grid size and bends, running in quadratic time.
Findings
Achieves planarity-preserving morphs with small grid size.
Uses only a constant number of bends per edge.
Runs in O(n^2) time on a standard word RAM model.
Abstract
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an -vertex planar graph and two planar straight-line drawings of the graph on an grid. The planarity-preserving morph is composed of linear morphs between successive pairs of drawings, each on an grid with a constant number of bends per edge. The algorithm to compute the morph runs in time on a word RAM model with standard arithmetic operations -- in particular no square roots or cube roots are required. The first step of the algorithm is to morph each input drawing to a planar orthogonal box drawing where vertices are represented by boxes and each edge is drawn as a horizontal or vertical segment. The second step is to morph between planar orthogonal box drawings.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
