Massively parallel software rendering for visualizing large-scale data sets
Kwan‐Liu Ma, S. Parker · IEEE Computer Graphics and Applications · 2001
We describe two highly scalable, parallel software volume-rendering algorithms - one renders unstructured grid volume data and the other renders isosurfaces. We designed one algorithm for distributed-memory parallel architectures to render unstructured grid volume data. We designed the other for shared-memory parallel architectures to directly render isosurfaces. Through the discussion of these two algorithms, we address the most relevant issues when using massively parallel computers to render large-scale volumetric data. The focus of our discussion is direct rendering of volumetric data.
Cited by 29 works. doi:10.1109/38.933526
Authors
References
- Marching cubes: A high resolution 3D surface construction algorithm
- Marching cubes: A high resolution 3D surface construction algorithm
- Display of surfaces from volume data
- Octrees for faster isosurface generation
- A Fast Voxel Traversal Algorithm for Ray Tracing
- Interactive ray tracing for isosurface rendering
- A near optimal isosurface extraction algorithm using the span space
- Application-Controlled Demand Paging for Out-of-Core Visualization
- 10.1016/b978-0-08-049905-5.50010-x
- The asymptotic decider: resolving the ambiguity in marching cubes