agorajs: implementation of the Fast Node Overlap Removal (VPSC) algorithm - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Logiciel Année : 2019

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)

Dates et versions

lirmm-04722079 , version 1 (04-10-2024)

Identifiants

Citer

Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry. agorajs: implementation of the Fast Node Overlap Removal (VPSC) algorithm. 2019, ⟨swh:1:dir:d6bfdd86b5c4886fc704d9c9242927cd88732aa7;origin=https://github.com/agorajs/agora-vpsc⟩. ⟨lirmm-04722079⟩
17 Consultations
0 Téléchargements

Partager

More