Quasi-upward planar drawings with minimum curve complexity
From MaRDI portal
Publication:2151443
DOI10.1007/978-3-030-92931-2_14OpenAlexW3193884440MaRDI QIDQ2151443
Alessandra Tappini, Giuseppe Liotta, Carla Binucci, Emilio Di Giacomo
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2108.10784
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Planar confluent orthogonal drawings of 4-modal digraphs ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Parameterized complexity of graph planarity with restricted cyclic orders
Cites Work
- Unnamed Item
- Upward drawings of triconnected digraphs.
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Quasi-upward planarity
- A better heuristic for orthogonal graph drawings
- Bend-minimum orthogonal drawings in quadratic time
- Drawing planar graphs using the canonical ordering
- On the curve complexity of 3-colored point-set embeddings
- Upward and quasi-upward planarity testing of embedded mixed graphs
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Upward Spirality and Upward Planarity Testing
- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Planar L-Drawings of Bimodal Graphs
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- On the Total Number of Bends for Planar Octilinear Drawings
- Algorithms – ESA 2004
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods
- Compact drawings of 1-planar graphs with right-angle crossings and few bends
This page was built for publication: Quasi-upward planar drawings with minimum curve complexity
