Sliding column model for t-unit bar visibility representations of graphs

DOI10.1142/s1793830922501373zbMath1524.68232MaRDI QIDQ6174768

Shaheena Sultana, Md. Manzurul Hasan, Md. Saidur Rahman

Publication date: 15 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

planar graphsnon-planar graphsorthogonal drawingunit bar visibility number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relating bends and size in orthogonal graph drawings
• A unified approach to visibility representations of planar graphs
• A better heuristic for orthogonal graph drawings
• Drawing planar graphs using the canonical ordering
• No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
• Basic graph theory
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• The Unit Bar Visibility Number of a Graph
• Spirality and Optimal Orthogonal Drawings
• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
• Orthogonal Drawings of Plane Graphs Without Bends
• Optimal orthogonal drawings of triconnected plane graphs
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• The Bar Visibility Number of a Graph
• Accelerated Bend Minimization

This page was built for publication: Sliding column model for t-unit bar visibility representations of graphs