A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and interpret a drawing of a graph. However, maximizing the crossing resolution turns out to be an NP-hard problem in general and only heuristic algorithms are known that are mainly based on appropriately adjusting force-directed algorithms.
In this paper, we propose a new heuristic algorithm for the crossing resolution maximization problem and we experimentally compare it against the known approaches from the literature. Our experimental evaluation indicates that the new heuristic produces drawings with better crossing resolution, but this comes at the cost of slightly higher aspect ratio, especially when the input graph is large.
This project was supported by DFG grant KA812/18-1. The authors would also like to acknowledge Simon Wegendt and Jessica Wolz for implementing the first version of our prototype.
- 9.Bekos, M.A., et al.: A heuristic approach towards drawings of graphs with high crossing resolution. CoRR, abs/xxxx.yyyy (2018). https://arxiv.org/abs/xxxx.yyyy
- 12.Di Battista, G., Didimo, W.: GDToolkit. In: Tamassia, R. (ed), Handbook on Graph Drawing and Visualization, pp. 571–597. Chapman and Hall/CRC (2013)Google Scholar
- 16.Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. CoRR, abs/1804.07257 arXiv:1803.03705 (2018)
- 17.Didimo, W., Liotta, G., Romeo, S.A.: Graph visualization techniques for conceptual web site traffic analysis. In: IEEE PacificVis, pp. 193–200. IEEE Computer Society (2010). https://doi.org/10.1109/PACIFICVIS.2010.5429593
- 19.Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago J. Theor. Comput. Sci. (2011). http://cjtcs.cs.uchicago.edu/articles/CATS2010/4/contents.html
- 30.Hong, S., Tokuyama, T.: Algorithmics for beyond planar graphs. NII Shonan Meeting Seminar 089, 27 November–1 December 2016Google Scholar
- 31.Huang, W.: Using eye tracking to investigate graph layout effects. In: Hong, S., Ma, K. (eds.) APVIS, pp. 97–100. IEEE Computer Society (2007). https://doi.org/10.1109/APVIS.2007.329282
- 35.Kaufmann, M., Kobourov, S., Pach, J., Hong, S.: Beyond planar graphs: Algorithmics and combinatorics. Dagstuhl Seminar 16452(November), 6–11 (2016)Google Scholar
- 37.Liotta, G.: Graph drawing beyond planarity: some results and open problems. SoCG Week, Invited talk, 4th July 2017Google Scholar