Efficient orthogonal drawings of high degree graphs
From MaRDI portal
Publication:1969947
DOI10.1007/s004539910006zbMath0951.68099OpenAlexW2049441051MaRDI QIDQ1969947
Ioannis. G. Tollis, Achilleas Papakostas
Publication date: 12 December 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004539910006
Related Items
Optimal three-dimensional orthogonal graph drawing in the general position model., Drawing Graphs with Right Angle Crossings, A Riemannian approach to graph embedding, New results on drawing angle graphs, Algorithms for area-efficient orthogonal drawing, Overloaded Orthogonal Drawings, THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING, Area, curve complexity, and crossing resolution of non-planar graph drawings, An experimental comparison of four graph drawing algorithms., Square-Orthogonal Drawing with Few Bends per Edge, The DFS-heuristic for orthogonal graph drawing, Drawing graphs with right angle crossings, Non-planar square-orthogonal drawing with few-bend edges, Right Angle Crossing Drawings of Graphs
