On Turn-Regular Orthogonal Representations
DOI10.1007/978-3-030-68766-3_20OpenAlexW3135766535MaRDI QIDQ5014121FDOQ5014121
Authors: Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter 
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)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Drawing graphs. Methods and models
- A better heuristic for orthogonal graph drawings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing an st-numbering
- Rectilinear Graphs and Their Embeddings
- On the complexity of orthogonal compaction
- Accelerated Bend Minimization
- Minimum Rectilinear Polygons for Given Angle Sequences
- Upward Planar Drawings and Switch-regularity Heuristics
- A better heuristic for area-compaction of orthogonal representations
- Turn-regularity and optimal area drawings of orthogonal representations
- Trees with Convex Faces and Optimal Angles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Switch-regular upward planarity testing of directed trees
Cited In (3)
This page was built for publication: On Turn-Regular Orthogonal Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014121)
