Efficient orthogonal drawings of high degree graphs
Orthogonal drawings of graphs of high degree (more than four) are concerned. At first, the authors present a short survey of earlier papers concerning orthogonal drawings of graphs. It is mentioned that the algorithm proposed by Biedl possess better estimates of the drawing area for rather dense graphs than the given in this paper algorithm \ does. Then, the authors investigate the Simple Algorithm for explaining the basic visualization techniques followed. Next, the algorithm BOX\_ORTHOGONAL for orthogonal drawings of simple graphs with degree higher than four is developed. The algorithm contains several phases. The first phase called the preprocessing phase concerns enumeration of vertices that they follow to enter the drawing. Then, the vertices are paired and grouped consisting two and more than two vertices, respectively. Next, the authors develop the placement technique of the vertices in order to diminish the number of necessary bends, several cases are discussed. The algorithm characterize: * total number of bends at most \(m-2,\) * at most one bend per edge, * the area of produced drawing is at most \((m-1)\times (m/2+2),\) * running time is \(O(m),\) where \(m\) is the number of edges. The placement techniques applied reduce the number of crossings needed, nevertheless the number of crossings is not estimated. That makes the estimates for the number of bends actually less significant. The Ph. thesis of Papakostas is recalled for detailed applications concerning also 3D drawings.
- New results on drawing angle graphs
- Algorithms for area-efficient orthogonal drawing
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- An experimental comparison of four graph drawing algorithms.
- The three-phase method: a unified approach to orthogonal graph drawing
- scientific article; zbMATH DE number 1693471 (Why is no real title available?)
- Algorithms and bounds for overloaded orthogonal drawings
- Drawing Graphs with Right Angle Crossings
- Overloaded orthogonal drawings
- On the Hardness of Orthogonal-Order Preserving Graph Drawing
- scientific article; zbMATH DE number 2080110 (Why is no real title available?)
- Techniques for the Refinement of Orthogonal Graph Drawings
- Square-orthogonal drawing with few bends per edge
- Right Angle Crossing Drawings of Graphs
- Orthogonal drawing of high degree graphs with small area and few bends
- Orthogonal Hypergraph Drawing for Improved Visibility
- The DFS-heuristic for orthogonal graph drawing
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Ortho-radial drawing in near-linear time
- Drawing graphs with right angle crossings
- Non-planar square-orthogonal drawing with few-bend edges
- A Riemannian approach to graph embedding
This page was built for publication: Efficient orthogonal drawings of high degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969947)
