2015 IEEE International Conference on Big Data (Big Data) 2015
DOI: 10.1109/bigdata.2015.7364046
|View full text |Cite
|
Sign up to set email alerts
|

Texture-based edge bundling: A web-based approach for interactively visualizing large graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 10 publications
0
13
0
Order By: Relevance
“…Within NeuroCave, node selection and the edge display are synchronized between the two side-by-side views: selecting a node in one view activates the node and displays its corresponding edges across both viewing areas, independent of the chosen configuration for each side. In order to make real-time manipulation of large datasets possible, we use hardware-accelerated graphics and extend a texture-based implementation of the FDEB algorithm (Wu et al, 2015 ). Our implementation harnesses the computational power of the graphical processing unit (GPU) in order to perform the required computations, and is at least 50 times faster than its CPU counterpart, enabling real-time edge bundling of over 1,000 edges at interactive rates (tested on a desktop computer with the following hardware: Intel Core i7, 3.4 GHz CPU, a Nvidia GTX 1070 GPU card, and 32GB RAM).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Within NeuroCave, node selection and the edge display are synchronized between the two side-by-side views: selecting a node in one view activates the node and displays its corresponding edges across both viewing areas, independent of the chosen configuration for each side. In order to make real-time manipulation of large datasets possible, we use hardware-accelerated graphics and extend a texture-based implementation of the FDEB algorithm (Wu et al, 2015 ). Our implementation harnesses the computational power of the graphical processing unit (GPU) in order to perform the required computations, and is at least 50 times faster than its CPU counterpart, enabling real-time edge bundling of over 1,000 edges at interactive rates (tested on a desktop computer with the following hardware: Intel Core i7, 3.4 GHz CPU, a Nvidia GTX 1070 GPU card, and 32GB RAM).…”
Section: Discussionmentioning
confidence: 99%
“…Standard implementations of edge bundling are too slow for the large numbers of edges that can appear in some connectome datasets visualized in NeuroCave, reducing the frame rate of the application and preventing an effective real-time experience. Therefore, we introduce an enhanced WebGL texture-based implementation, extending previous work by Wu, Yu, & Yu ( 2015 ). In our approach, we can increase the maximum number of edges between nodes through the use of multiple GPU textures.…”
Section: Methodsmentioning
confidence: 99%
“…Although this algorithm can handle graphs containing millions of edges, a complex modeling process is necessary before the edge bundling step. Compared with the MINGLE algorithm, Zhu et al [26] and Wu et al [27] demonstrated a different approach to execute FDEB, in which they leveraged GPUs to accelerate computing. Tuyishime [28] proposed a distributed edge bundling for large graphs that was able to tackle graphs that were not stored in a single machine.…”
Section: B Edge Bundlingmentioning
confidence: 99%
“…4h,k,l) further enhances KDEEB and ADEB by proposing a far more efficient density estimation, also implemented on the GPU, making it possible for the first time to bundle sets of up to a million trails at interactive framerates [vdZCT16]. Separately, Texture Edge Bundling (TEB) proposes a GPU-based implementation making heavy use of texture synthesis and processing, optimized for web access [WYY15]. Lastly, Fast Fourier Transform Edge Bundling (FFTEB, Fig.…”
Section: Static Trail-setsmentioning
confidence: 99%