On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
From MaRDI portal
Publication:1741861
DOI10.1007/s00453-018-0523-5zbMath1421.68106arXiv1708.09197OpenAlexW3213401242WikidataQ129043321 ScholiaQ129043321MaRDI QIDQ1741861
Publication date: 7 May 2019
Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09197
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Polygons with Prescribed Angles in 2D and 3D ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ Polygons with Prescribed Angles in 2D and 3D
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orthogonal graph drawing with flexibility constraints
- A linear-time algorithm for drawing a planar graph on a grid
- Orthogonal graph drawing with inflexible edges
- How to draw a planar graph on a grid
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- A better heuristic for orthogonal graph drawings
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
- Support-vector networks
- Drawing planar graphs using the canonical ordering
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Smooth Orthogonal Layouts
- On the Complexity of HV-rectilinear Planarity Testing
- Approximate common divisors via lattices
- Arc Diagrams, Flip Distances, and Hamiltonian Triangulations
- How to share a secret
- Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
- Hanani-Tutte and Monotone Drawings
- Improved Primitives for Secure Multiparty Integer Computation
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Computing orthogonal drawings with the minimum number of bends
- Planar Lombardi Drawings for Subcubic Graphs
- On the Total Number of Bends for Planar Octilinear Drawings
- The Planar Slope Number of Subcubic Graphs
- Smooth Orthogonal Drawings of Planar Graphs
- Drawing HV-Restricted Planar Graphs
- Drawing Planar Graphs of Bounded Degree with Few Slopes
- Lombardi Drawings of Graphs
- Planar Octilinear Drawings with One Bend Per Edge
- Drawing graphs. Methods and models
This page was built for publication: On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
