On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Orthogonal graph visualization: the three-phase method with applications
Orthogonal graph visualization: the three-phase method with applications
New results on drawing angle graphs
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
A new approximation algorithm for the planar augmentation problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Nice drawings of graphs are computationally hard
Selected Contributions from the on 7th Interdisciplinary Workshop on Informatics and Psychology: Visualization in Human-Computer Interaction
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
ArchE: A Graph Drawing System for Archaeology
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Optimal Orthogonal Drawings of Connected Plane Graphs
Proceedings of the 8th Canadian Conference on Computational Geometry
On the Computational Complexity of Upward and Rectilinear Planarity Testing
On the Computational Complexity of Upward and Rectilinear Planarity Testing
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
Graph Drawing Algorithm Engineering with AGD
Revised Lectures on Software Visualization, International Seminar
Fast Layout Methods for Timetable Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
GPSel: A Gestural Perceptual-Based Path Selection Technique
SG '09 Proceedings of the 10th International Symposium on Smart Graphics
On the Hardness and Approximability of Planar Biconnectivity Augmentation
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Algorithms and theory of computation handbook
The straight-line RAC drawing problem is NP-hard
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Maximizing the total resolution of graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'10 Proceedings of the 18th international conference on Graph drawing
Optimal 3D angular resolution for low-degree graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Planar straight-line drawing in an O(n)×O(n) grid with angular resolution Ω(1/n)
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Curvilinear graph drawing using the force-directed method
GD'04 Proceedings of the 12th international conference on Graph Drawing
GD'09 Proceedings of the 17th international conference on Graph Drawing
Planar and poly-arc lombardi drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Force-Directed lombardi-style graph drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
CDEG: computerized diagrammatic euclidean geometry 2.0
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
ImPrEd: an improved force-directed algorithm that prevents nodes from crossing edges
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
On the usability of lombardi graph drawings
GD'12 Proceedings of the 20th international conference on Graph Drawing
Domain specific vs generic network visualization: an evaluation with metabolic networks
AUIC '11 Proceedings of the Twelfth Australasian User Interface Conference - Volume 117
| Hi-index | 0.00 |
We present a linear time algorithm that constructs a planar polyline grid drawing of any plane graph with n vertices and maximum degree n on a (2n - 5) 脳 (3/2n - 7/2) grid with at most 5n - 15 bends and minimum angle 2/d. In the constructed drawings, every edge has at most three bends and length O(n). To our best knowledge, this algorithm achieves the best simultaneous bounds concerning the grid size, angular resolution, and number of bends for planar grid drawings of high-degree planar graphs. Besides the nice theoretical features, the practical drawings are aesthetically very pleasing. An implementation of our algorithm is available with the AGD-Library (Algorithms for Graph Drawing) [2, 1]. Our algorithm is based on ideas by Kant for polyline grid drawings for triconnected plane graphs [23]. In particular, our algorithm significantly improves upon his bounds on the angular resolution and the grid size for non-triconnected plane graphs. In this case, Kant could show an angular resolution of 4/3d+7 and a grid size of (2n - 5) 脳 (3n - 6), only.