Algorithms for area-efficient orthogonal drawing

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

Ioannis. G. Tollis, Achilleas Papakostas

Publication date: 1 July 1998

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

zbMATH Keywords

orthogonal drawing of a graph

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

Related Items

Unnamed Item, Square-Orthogonal Drawing with Few Bends per Edge, The DFS-heuristic for orthogonal graph drawing, Non-planar square-orthogonal drawing with few-bend edges, Algorithms for computing a parameterized \(st\)-orientation, Clean the graph before you draw it!, Optimal \(st\)-orientations for plane triangulations, Advances in the theory and practice of graph drawing, Three-dimensional orthogonal graph drawing algorithms, Modifying orthogonal drawings for label placement, Balanced vertex-orderings of graphs, NP-completeness of st-orientations for plane graphs, Imbalance is fixed parameter tractable, Fan-crossing free graphs and their relationship to other beyond-planar graphs, THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING, Overloaded Orthogonal Drawings

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)