A Random Sampling O(n) Force-calculation Algorithm for Graph Layouts

dc.contributor.authorGove, Roberten_US
dc.contributor.editorGleicher, Michael and Viola, Ivan and Leitte, Heikeen_US
dc.date.accessioned2019-06-02T18:29:03Z
dc.date.available2019-06-02T18:29:03Z
dc.date.issued2019
dc.description.abstractThis paper proposes a linear-time repulsive-force-calculation algorithm with sub-linear auxiliary space requirements, achieving an asymptotic improvement over the Barnes-Hut and Fast Multipole Method force-calculation algorithms. The algorithm, named random vertex sampling (RVS), achieves its speed by updating a random sample of vertices at each iteration, each with a random sample of repulsive forces. This paper also proposes a combination algorithm that uses RVS to derive an initial layout and then applies Barnes-Hut to refine the layout. An evaluation of RVS and the combination algorithm compares their speed and quality on 109 graphs against a Barnes-Hut layout algorithm. The RVS algorithm performs up to 6.1 times faster on the tested graphs while maintaining comparable layout quality. The combination algorithm also performs faster than Barnes-Hut, but produces layouts that are more symmetric than using RVS alone. Data and code: https://osf.io/nb7m8/en_US
dc.description.number3
dc.description.sectionheadersGraphs and Networks
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume38
dc.identifier.doi10.1111/cgf.13724
dc.identifier.issn1467-8659
dc.identifier.pages739-751
dc.identifier.urihttps://doi.org/10.1111/cgf.13724
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13724
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectHuman
dc.subjectcentered computing
dc.subjectGraph drawings
dc.subjectEmpirical studies in visualization
dc.titleA Random Sampling O(n) Force-calculation Algorithm for Graph Layoutsen_US
Files
Collections