Orthogonal layout with optimal face complexity

DOI10.1016/j.comgeo.2017.02.005zbMath1429.68166OpenAlexW2594681883MaRDI QIDQ1616241

Stephen G. Kobourov, Debajyoti Mondal, Md. Jawaherul Alam

Publication date: 1 November 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2017.02.005

zbMATH Keywords

graph drawingorthogonal drawingface complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

A topology-shape-metrics framework for ortho-radial graph drawing ⋮ Unnamed Item

Uses Software

• Graphviz
• yFiles
• OGDF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal graph drawing with flexibility constraints
• A better heuristic for orthogonal graph drawings
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Orthogonal Layout with Optimal Face Complexity
• Beyond the flow decomposition barrier
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Universality considerations in VLSI circuits
• Network Flow and Testing Graph Connectivity
• Optimal Orthogonal Graph Drawing with Convex Bend Costs
• The Monotone Satisfiability Problem with Bounded Variable Appearances
• INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Accelerated Bend Minimization
• Drawing graphs. Methods and models

This page was built for publication: Orthogonal layout with optimal face complexity