Show simple item record

dc.contributor.authorGove, Roberten_US
dc.contributor.editorGleicher, Michael and Viola, Ivan and Leitte, Heikeen_US
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:
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectcentered computing
dc.subjectGraph drawings
dc.subjectEmpirical studies in visualization
dc.titleA Random Sampling O(n) Force-calculation Algorithm for Graph Layoutsen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersGraphs and Networks

Files in this item


This item appears in the following Collection(s)

  • 38-Issue 3
    EuroVis 2019 - Conference Proceedings

Show simple item record