On the angular resolution of planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Drawing graphs in the plane with high resolution
SIAM Journal on Computing
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Drawing graphs: methods and models
Drawing graphs: methods and models
Planar Polyline Drawings with Good Angular Resolution
GD '98 Proceedings of the 6th 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
The Minimum Area of Convex Lattice n-Gons
Combinatorica
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion
IV '05 Proceedings of the Ninth International Conference on Information Visualisation
Drawing Graphs with Right Angle Crossings
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Area, curve complexity, and crossing resolution of non-planar graph drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
On the perspectives opened by right angle crossing drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
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
Vertex angle and crossing angle resolution of leveled tree drawings
Information Processing Letters
Establishing aesthetics based on human graph reading behavior: two eye tracking studies
Personal and Ubiquitous Computing
Right angle crossing graphs and 1-planarity
Discrete Applied Mathematics
Hi-index | 0.00 |
A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident to a common node (angular resolution) or by the angles formed at edge crossings (crossing resolution). In this paper, we evaluate both by introducing the notion of "total resolution", that is, the minimum of the angular and crossing resolution. To the best of our knowledge, this is the first time where the problem of maximizing the total resolution of a drawing is studied. The main contribution of the paper consists of drawings of asymptotically optimal total resolution for complete graphs (circular drawings) and for complete bipartite graphs (2-layered drawings). In addition, we present and experimentally evaluate a force-directed based algorithm that constructs drawings of large total resolution.