Orthogonal Ordering
Spread Minimisation
Global Shape Preservation
Node Movement Minimisation
Edge Length Preservation
[1] K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages & Computing, 6(2): 83–210, 1995.
[2] K. A. Lyons, H. Meijer, and D. Rappaport. Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications, 2(1): 1–24, 1998.
[3] K. Hayashi, M. Inoue, T. Masuzawa, and H. Fujiwara. A layout adjustment problem for disjoint rectangles preserving orthogonal order. In Proceedings of the International Symposium on Graph Drawing (GD), pages 183–197. Springer, 1998.
[4] X. Huang and W. Lai. Force-transfer: a new approach to removing overlapping nodes in graph layout. In Proceedings of the Australasian computer science conference - Volume 16, pages 349–358. Australian Computer Society, Inc., 2003.
[5] K. Marriott, P. Stuckey, V. Tam, and W. He. Removing node overlapping in graph layout using constrained optimization. Constraints, 8(2): 43–171, 2003.
[6] W. Li, P. Eades, and N. Nikolov. Using spring algorithms to remove node overlapping. In Proceedings of the Asia-Pacific Symposium on Information Visualisation (APVis’05), pages 131–140. Australian Computer Society, Inc., 2005.
[7] T. Dwyer, K. Marriott, and P. J. Stuckey. Fast node overlap removal. In Proceedings of the International Symposium on Graph Drawing (GD), pages 153–164. Springer, 2005.
[8] X. Huang, W. Lai, A. Sajeev, and J. Gao. A new algorithm for removing node overlapping in graph visualization. Information Sciences, 177(14): 2821–2844, 2007.
[9] E. Gansner and Y. Hu. Efficient, proximity-preserving node overlap removal. Journal of Graph Algorithms and Applications, 14(1): 53–74, 2010.
[10] H. Strobelt, M. Spicker, A. Stoffel, D. Keim, and O. Deussen. Rolled-out wordles: A heuristic method for overlap removal of 2d data representatives. Computer Graphics Forum, 31(3): 1135–1144, 2012.
[11] L. Nachmanson, A. Nocaj, S. Bereg, L. Zhang, and A. Holroyd. Node overlap removal by growing a tree. In Proceedings of the International Symposium on Graph Drawing and Network Visualization (GD), pages 33–43. Springer, 2016.
[12] W. Meulemans. Efficient optimal overlap removal. Computer Graphics Forum, 38(3): 713–723, 2019.
[13] F. Chen, L. Piccinini, P. Poncelet, and A. Sallaberry. Node overlap removal algorithms: A comparative study. In Proceedings of the International Symposium on Graph Drawing and Network Visualization (GD), pages 179–192, Springer, 2019.
[14] F. Chen, L. Piccinini, P. Poncelet, and A. Sallaberry. Node Overlap Removal Algorithms: An Extended Comparative Study. In Journal of Graph Algorithms and Applications, Vol. 24, no. 4, pp. 683-706, 2020. Regular paper.
[15] L. Giovannangeli, F. Lalanne, R. Giot, R. Bourqui . FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawing. Arxiv.