300 likes | 387 Vues
Explore the benefits of unstructured data partitioning techniques for large-scale visualization pipelines. Learn how parallel rendering and mesh partitioning improve efficiency and performance in visualizing complex datasets. Understand the role of K-D trees in spatial structure partitioning and reconstructing connectivity information. Discover solutions for parallel visualization challenges and future work directions.
E N D
Unstructured Data Partitioning for Large Scale Visualization CSCAPES Workshop June, 2008 Kenneth Moreland Sandia National Laboratories Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company,for the United States Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000.
Read Isosurface Reflect Render The Parallel Visualization Pipeline
Read Read Read Read Isosurface Isosurface Isosurface Isosurface Reflect Reflect Reflect Reflect Render Render Render Render The Parallel Visualization Pipeline
Data Parallel Pipelines • Duplicate pipelines run independently on different partitions of data.
Data Parallel Pipelines • Duplicate pipelines run independently on different partitions of data.
Data Parallel Pipelines • Some operations will work regardless. • Example: Clipping.
Data Parallel Pipelines • Some operations will work regardless. • Example: Clipping.
Data Parallel Pipelines • Some operations will work regardless. • Example: Clipping.
Data Parallel Pipelines • Some operations will have problems. • Example: External Faces
Data Parallel Pipelines • Some operations will have problems. • Example: External Faces
Data Parallel Pipelines • Ghost cells can solve most of these problems.
Data Parallel Pipelines • Ghost cells can solve most of these problems.
Read Read Read Read Isosurface Isosurface Isosurface Isosurface Reflect Reflect Reflect Reflect Render Render Render Render The Parallel Visualization Pipeline
K-D Trees Provide Query Structures What elements are closest to here?
K-D Trees Provide Query Structures What regions / elements intersect this view frustum?
K-D Trees Provide Query Structures 8 4 What is the visibility order of the regions from this viewpoint? 7 1 5 6 2 3
Reconstructing Connectivity Information May not be unique. Neighbor info usually missing.
Future Work • Code Optimization and Cleanup • Integration of other partitioning algorithms. • Better Data Type Support. • Better Temporal Support.