Towards a Characterization of Stretchable Aligned Graphs

DOI10.1007/978-3-030-68766-3_23OpenAlexW3133867163MaRDI QIDQ5014124

Ignaz Rutter, Marcel Radermacher, Peter Stumpf

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.06300

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Every collinear set in a planar graph is free
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Drawing Graphs on Few Lines and Few Planes
• Towards an implementation of the 3D visibility skeleton
• Drawing planar graphs with many collinear vertices
• Aligned Drawings of Planar Graphs
• How to Draw a Graph

This page was built for publication: Towards a Characterization of Stretchable Aligned Graphs