Algorithms for area-efficient orthogonal drawing

DOI10.1016/S0925-7721(97)00017-5zbMath0894.68102OpenAlexW2052218573MaRDI QIDQ1384191

Ioannis. G. Tollis, Achilleas Papakostas

Publication date: 1 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00017-5

zbMATH Keywords

orthogonal drawing of a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (21)

Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Overloaded Orthogonal Drawings ⋮ A topology-shape-metrics framework for ortho-radial graph drawing ⋮ An annotated review on graph drawing and its applications ⋮ Proper colorability of segment intersection graphs ⋮ THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING ⋮ Imbalance is fixed parameter tractable ⋮ Modifying orthogonal drawings for label placement ⋮ Unnamed Item ⋮ Algorithms for computing a parameterized \(st\)-orientation ⋮ Square-Orthogonal Drawing with Few Bends per Edge ⋮ The DFS-heuristic for orthogonal graph drawing ⋮ NP-completeness of st-orientations for plane graphs ⋮ Balanced vertex-orderings of graphs ⋮ Clean the graph before you draw it! ⋮ Imbalance parameterized by twin cover revisited ⋮ Non-planar square-orthogonal drawing with few-bend edges ⋮ Efficient Algorithms for Ortho-Radial Graph Drawing. ⋮ Optimal \(st\)-orientations for plane triangulations ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ Advances in the theory and practice of graph drawing

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds for planar orthogonal drawings of graphs
• Computing an st-numbering
• Algorithms for drawing graphs: An annotated bibliography
• A better heuristic for orthogonal graph drawings
• Drawing graphs on rectangular grids
• Efficient orthogonal drawings of high degree graphs
• On pairwise compatibility graphs having Dilworth number two
• On minimal-node-cost planar embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Universality considerations in VLSI circuits
• Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)

This page was built for publication: Algorithms for area-efficient orthogonal drawing