agorajs: implementation of the Fast Node Overlap Removal (VPSC) algorithm
Résumé
Implementation for Agorajs of the Fast Node Overlap Removal (VPSC) algorithm. courtesy to the webcola framework https://github.com/tgdwyer/WebCola Tim Dwyer, Kim Marriott, Peter J.Stuckey A new algorithm for removing node overlapping in graph visualization, Graph Drawing 2005 Pages 153-164, Lecture Notes in Computer Science, vol 3843. 2006, Springer, Berlin, Heidelberg ISBN 978-3-540-31667-1, Online ISBN 978-3-540-31667-1, https://doi.org/10.1007/11618058_15. (https://link.springer.com/chapter/10.1007%2F11618058_15)
Domaines
Est requise par lirmm-04721855 Logiciel Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry. agorajs: website. 2020, ⟨swh:1:dir:0ad34041a96e758f89ff5a07f2832463e303601d;origin=https://github.com/agorajs/agorajs.github.io⟩. ⟨lirmm-04721855⟩
Requiert lirmm-04721903 Logiciel Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry. agorajs: graph library. 2019, ⟨swh:1:dir:25fb80dfe3c0b194672adbf6f0faaaa98faeb082;origin=https://github.com/agorajs/agora-graph⟩. ⟨lirmm-04721903⟩
Cite 10.7155/jgaa.00532 Autre Chen, F., Piccinini, L., Poncelet, P., & Sallaberry, A. (2020). Node Overlap Removal Algorithms: an Extended Comparative Study. Journal of Graph Algorithms and Applications, 24(4), 683–706. https://doi.org/10.7155/jgaa.00532
