On embedding a graph in the grid with the maximum number of bends and other bad features

DOI10.1007/s00224-008-9115-0zbMath1192.68742OpenAlexW2153361631MaRDI QIDQ2272195

Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9115-0

zbMATH Keywords

planaritygraph drawingorthogonal drawingstopology-shape-metrics approach

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds for planar orthogonal drawings of graphs
• On Conway's thrackle conjecture
• Turn-regularity and optimal area drawings of orthogonal representations
• Bounds for generalized thrackles
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Rectilinear Graphs and Their Embeddings
• 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
• Computing orthogonal drawings with the minimum number of bends
• On the complexity of orthogonal compaction

This page was built for publication: On embedding a graph in the grid with the maximum number of bends and other bad features