On Turn-Regular Orthogonal Representations
From MaRDI portal
Publication:5014121
DOI10.1007/978-3-030-68766-3_20OpenAlexW3135766535MaRDI QIDQ5014121
Karsten Klein, Giuseppe Di Battista, Maurizio Patrignani, Martin Gronemann, Ignaz Rutter, Carla Binucci, Michael A. Bekos, Walter Didimo
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.09002
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
On Turn-Regular Orthogonal Representations ⋮ An annotated review on graph drawing and its applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing an st-numbering
- A better heuristic for orthogonal graph drawings
- Turn-regularity and optimal area drawings of orthogonal representations
- A better heuristic for area-compaction of orthogonal representations
- Switch-Regular Upward Planarity Testing of Directed Trees
- Minimum Rectilinear Polygons for Given Angle Sequences
- Trees with Convex Faces and Optimal Angles
- Rectilinear Graphs and Their Embeddings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Upward Planar Drawings and Switch-regularity Heuristics
- Accelerated Bend Minimization
- On the complexity of orthogonal compaction
- Drawing graphs. Methods and models
This page was built for publication: On Turn-Regular Orthogonal Representations