Upward planar morphs
From MaRDI portal
Publication:5918180
DOI10.1007/s00453-020-00714-6zbMath1455.68137OpenAlexW3024883420MaRDI QIDQ5918180
Maurizio Patrignani, Giuseppe Di Battista, Fabrizio Frati, Giordano Da Lozzo, Vincenzo Roselli
Publication date: 12 October 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00714-6
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Planar and Toroidal Morphs Made Easier, From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs, Planar and toroidal morphs made easier, On morphing 1-planar drawings, Morphing triangle contact representations of triangulations, Upward book embeddability of \(st\)-graphs: complexity and algorithms, How to morph a tree on a small grid, On the upward book thickness problem: combinatorial and complexity results, A Tipping Point for the Planarity of Small and Medium Sized Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deformations of plane graphs
- Upward drawings of triconnected digraphs.
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Algorithms for plane representations of acyclic digraphs
- Area requirement and symmetry display of planar upward drawings
- On the number of upward planar orientations of maximal planar graphs
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Morphing Planar Graph Drawings Efficiently
- Efficient Planarity Testing
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- Morphing Planar Graph Drawings Optimally
- Optimal Morphs of Convex Drawings
- How to Morph Planar Graph Drawings
- Morphing Planar Graph Drawings with a Polynomial Number of Steps
- Deformations of Plane Rectilinear Complexes
- Morphing orthogonal planar graph drawings
- Extending upward planar graph drawings
- Graph Drawing
- Upward planar morphs
- How to morph a tree on a small grid
- Convexity-increasing morphs of planar graphs
