A parallel streamline visualization algorithm based on dynamic node tree

Hao Chen; Cheng Chen; Xuejun Li; Xiaorong Zhang; Yadong Wu

doi:10.1117/12.2628141

18 February 2022 A parallel streamline visualization algorithm based on dynamic node tree

Hao Chen, Cheng Chen, Xuejun Li, Xiaorong Zhang, Yadong Wu

Proceedings Volume 12162, International Conference on High Performance Computing and Communication (HPCCE 2021); 121620Z (2022) https://doi.org/10.1117/12.2628141
Event: 2021 International Conference on High Performance Computing and Communication, 2021, Guangzhou, China

Abstract

Streamline is one of the most inspiring technologies to achieve fundamental goal of scientific insight from resulting numerical simulations. Drawing on an intuitive interpretation in terms of flow field, it is an ideal tool to illustrate and describe a wide range of phenomena encountered in the study of application-domain vector fields. In this paper, we propose a parallel streamline algorithm based on Dynamic Node Tree (DN-Tree), to improve the efficiency of streamline visualization algorithm with efficient utilization of multi core computing resources. Firstly, we realize fast location of grid cells via constructs a dynamic node tree in parallel. The grid cells are divided into coarse-grained and fine-grained partitions in terms of organizing and managing the dataset, and the index structure is established to conveniently narrow the alternative areas in the integration process. Secondly, we reduce memory requirements of streamline integration by the methods of data blocks attribute extraction and employ parallel execution of seed integral tasks to leverage multicore computing resources. Finally, the performance is analysed by comparing our algorithm with existing streamline algorithms using datasets of different scales. The results show that the proposed algorithm improve the efficiency of streamline visualization algorithm and can achieve a higher parallel speedup.

Citation Download Citation

Hao Chen, Cheng Chen, Xuejun Li, Xiaorong Zhang, and Yadong Wu "A parallel streamline visualization algorithm based on dynamic node tree", Proc. SPIE 12162, International Conference on High Performance Computing and Communication (HPCCE 2021), 121620Z (18 February 2022); https://doi.org/10.1117/12.2628141

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
8 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Visualization

Data storage

Picosecond phenomena

Data processing

Particles

Visual analytics

Numerical simulations

Show All Keywords

Keywords/Phrases

Search In:

Publication Years