Maximizing the Total Resolution of Graphs

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.

[1]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[2]  David A. Carrington,et al.  Empirical Evaluation of Aesthetics-based Graph Layout , 2002, Empirical Software Engineering.

[3]  Joachim Gudmundsson,et al.  Notes on Large Angle Crossing Graphs , 2009, Chic. J. Theor. Comput. Sci..

[4]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[5]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[6]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[7]  Michael Jünger,et al.  Graph Drawing Software , 2003, Graph Drawing Software.

[8]  Michael Kaufmann,et al.  On the Perspectives Opened by Right Angle Crossing Drawings , 2009, J. Graph Algorithms Appl..

[9]  Emilio Di Giacomo,et al.  Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings , 2009, Theory of Computing Systems.

[10]  Marc J. van Kreveld,et al.  The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs , 2010, GD.

[11]  Franz-Josef Brandenburg,et al.  An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms , 1995, GD.

[12]  Walter Didimo,et al.  A characterization of complete bipartite RAC graphs , 2010, Inf. Process. Lett..

[13]  Walter Didimo,et al.  Topology-Driven Force-Directed Algorithms , 2010, GD.

[14]  Seth M. Malitz,et al.  On the angular resolution of planar graphs , 1992, STOC '92.

[15]  François Bertault,et al.  A force-directed algorithm that preserves edge-crossing properties , 1999, Inf. Process. Lett..

[16]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[17]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[18]  Emilio Di Giacomo,et al.  Bounds on the crossing resolution of complete geometric graphs , 2012, Discret. Appl. Math..

[19]  Ulrik Brandes,et al.  Drawing on Physical Analogies , 2001, Drawing Graphs.

[20]  Norihide Tokushige,et al.  The Minimum Area of Convex Lattice n-Gons , 2004, Comb..

[21]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[22]  Michael Kaufmann,et al.  Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area , 2011, EGC.

[23]  Peter Eades,et al.  Edge crossings in drawings of bipartite graphs , 1994, Algorithmica.

[24]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[25]  P. Giblin.  Computational geometry: algorithms and applications (2nd edn.), by M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Pp. 367. £20.50. 2000. ISBN 3 540 65620 0 (Springer-Verlag). , 2001, The Mathematical Gazette.

[26]  Hsu-Chun Yen,et al.  A new force-directed graph drawing method based on edge-edge repulsion , 2005, Ninth International Conference on Information Visualisation (IV'05).

[27]  Gerhard J. Woeginger,et al.  Drawing graphs in the plane with high resolution , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[28]  Colin Ware,et al.  Cognitive Measurements of Graph Aesthetics , 2002, Inf. Vis..

[29]  Petra Mutzel,et al.  Planar Polyline Drawings with Good Angular Resolution , 1998, GD.

[30]  Hiroshi Nagamochi,et al.  An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings , 2005, Discret. Comput. Geom..

[31]  Peter Eades,et al.  Effects of Crossing Angles , 2008, 2008 IEEE Pacific Visualization Symposium.

[32]  Mark de Berg,et al.  Computational Geometry: Algorithms and Applications, Second Edition , 2000 .

[33]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[34]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[35]  Walter Didimo,et al.  Drawing graphs with right angle crossings , 2009, Theor. Comput. Sci..

[36]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.

[37]  Csaba D. Tóth,et al.  Graphs that admit right angle crossing drawings , 2010, Comput. Geom..

[38]  Helen C. Purchase,et al.  Effective information visualisation: a study of graph drawing aesthetics and algorithms , 2000, Interact. Comput..

[39]  Walter Didimo,et al.  A Graph Drawing Application to Web Site Traffic Analysis , 2011, J. Graph Algorithms Appl..

[40]  Weidong Huang,et al.  Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics , 2010, 2010 IEEE Symposium on Visual Languages and Human-Centric Computing.

[41]  Giuseppe Liotta,et al.  An experimental comparison of three graph drawing algorithms (extended abstract) , 1995, SCG '95.

[42]  Weidong Huang,et al.  Using eye tracking to investigate graph layout effects , 2007, 2007 6th International Asia-Pacific Symposium on Visualization.

[43]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[44]  Joseph O'Rourke,et al.  Computational geometry in C (2nd ed.) , 1998 .

[45]  Michael T. Goodrich,et al.  Drawing planar graphs with circular arcs , 1999, GD.

[46]  Gerard Tel,et al.  Journal of Graph Algorithms and Applications a Note on Rectilinearity and Angular Resolution , 2022 .

[47]  Michael A. Bekos,et al.  The Straight-Line RAC Drawing Problem is NP-Hard , 2010, J. Graph Algorithms Appl..