Volltext-Downloads (blau) und Frontdoor-Views (grau)

Accelerating Force-Directed Graph Drawing with RT Cores

  • Graph drawing with spring embedders employs a V x V computation phase over the graph's vertex set to compute repulsive forces. Here, the efficacy of forces diminishes with distance: a vertex can effectively only influence other vertices in a certain radius around its position. Therefore, the algorithm lends itself to an implementation using search data structures to reduce the runtime complexity. NVIDIA RT cores implement hierarchical tree traversal in hardware. We show how to map the problem of finding graph layouts with force-directed methods to a ray tracing problem that can subsequently be implemented with dedicated ray tracing hardware. With that, we observe speedups of 4x to 13x over a CUDA software implementation.

Export metadata

Additional Services

Search Google Scholar Check availability


Show usage statistics
Document Type:Preprint
Author:Stefan Zellmann, Martin Weier, Ingo Wald
ArXiv Id:http://arxiv.org/abs/2008.11235
Date of first publication:2020/08/25
Departments, institutes and facilities:Fachbereich Informatik
Dewey Decimal Classification (DDC):0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Entry in this database:2020/09/02