Bend-minimum orthogonal drawings in quadratic time
From MaRDI portal
Publication:1725783
DOI10.1007/978-3-030-04414-5_34OpenAlexW2889141356MaRDI QIDQ1725783
Maurizio Patrignani, Giuseppe Liotta, Walter Didimo
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1804.05813
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (9)
Planar rectilinear drawings of outerplanar graphs in linear time ⋮ Quasi-upward planar drawings with minimum curve complexity ⋮ An annotated review on graph drawing and its applications ⋮ Sketched representations and orthogonal planarity of bounded treewidth graphs ⋮ An SPQR-tree-like embedding representation for upward planarity ⋮ Unnamed Item ⋮ Bend-minimum orthogonal drawings in quadratic time ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for planar orthogonal drawings of graphs
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- A better heuristic for orthogonal graph drawings
- Bend-minimum orthogonal drawings in quadratic time
- Drawing planar graphs using the canonical ordering
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- On the Complexity of HV-rectilinear Planarity Testing
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Orthogonal Drawings of Plane Graphs Without Bends
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- Accelerated Bend Minimization
- Graph Drawing
- Graph Drawing
This page was built for publication: Bend-minimum orthogonal drawings in quadratic time
