Implement GPU-accelerated edge bundling #1124
Open
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
FFT bundling is an alternative edge bundling method to Datashader's existing Edgehammer bundling implementation. It runs magnitudes faster than Edgehammer on larger graphs (10k+ edges) thanks to GPU-acceleration and cuFFT.
FFT bundling takes input in the form of two dataframes (cuDF or Pandas) containing normalized node coordinates and an edge list, and outputs a cuDF dataframe containing line segments.
Performance and the end result depend greatly on several parameters:
The FFT edge bundling pipeline is similar to Edgehammer's with a few key differences.
Pipeline:
FFT bundling is still missing some features supported by the Edgehammer bundling method and could use some additional features such as support for weighted graphs, and 'batching' edges to avoid memory constraints. @ianthomas23 mentioned introducing it as an "experimental" feature for now.
@exactlyallan