The Community for Technology Leaders
2017 IEEE Pacific Visualization Symposium (PacificVis) (2017)
Seoul, South Korea
April 18, 2017 to April 21, 2017
ISSN: 2165-8773
ISBN: 978-1-5090-5739-9
pp: 190-199
Antoine Lhuillier , DEVI - ENAC, Toulouse, France
Christophe Hurter , DEVI - ENAC, Toulouse, France
Alexandru Telea , Institute Johann Bernoulli, University of Groningen, Netherlands
ABSTRACT
Edge bundling techniques provide a visual simplification of cluttered graph drawings or trail sets. While many bundling techniques exist, only few recent ones can handle large datasets and also allow selective bundling based on edge attributes. We present a new technique that improves on both above points, in terms of increasing both the scalability and computational speed of bundling, while keeping the quality of the results on par with state-of-the-art techniques. For this, we shift the bundling process from the image space to the spectral (frequency) space, thereby increasing computational speed. We address scalability by proposing a data streaming process that allows bundling of extremely large datasets with limited GPU memory. We demonstrate our technique on several real-world datasets and by comparing it with state-of-the-art bundling methods.
INDEX TERMS
Image edge detection, Graphics processing units, Kernel, Convolution, Scalability, Fourier transforms, Clutter,I.3.3 [Computing Methodologies]: Computer Graphics—Picture/Image Generation, I.3.6 [Computing Methodologies]: Computer Graphics—Methodology and Techniques
CITATION
Antoine Lhuillier, Christophe Hurter, Alexandru Telea, "FFTEB: Edge bundling of huge graphs by the Fast Fourier Transform", 2017 IEEE Pacific Visualization Symposium (PacificVis), vol. 00, no. , pp. 190-199, 2017, doi:10.1109/PACIFICVIS.2017.8031594
105 ms
(Ver 3.3 (11022016))