
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
1997 Parallel Rendering Symposium (PRS '97)
A scalable parallel cellprojection volume rendering algorithm for threedimensional unstructured data
Phoenix, AZ
October 19October 19
ISBN: 0818682655
ASCII Text  x  
KwanLiu Ma, T.W. Crockett, "A scalable parallel cellprojection volume rendering algorithm for threedimensional unstructured data," Parallel Rendering Symposium, pp. 95, 1997 Parallel Rendering Symposium (PRS '97), 1997.  
BibTex  x  
@article{ 10.1109/PRS.1997.628300, author = {KwanLiu Ma and T.W. Crockett}, title = {A scalable parallel cellprojection volume rendering algorithm for threedimensional unstructured data}, journal ={Parallel Rendering Symposium}, volume = {0}, year = {1997}, isbn = {0818682655}, pages = {95}, doi = {http://doi.ieeecomputersociety.org/10.1109/PRS.1997.628300}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  Parallel Rendering Symposium TI  A scalable parallel cellprojection volume rendering algorithm for threedimensional unstructured data SN  0818682655 SP EP A1  KwanLiu Ma, A1  T.W. Crockett, PY  1997 KW  rendering (computer graphics); scalable parallel cell projection volume rendering algorithm; three dimensional unstructured data; aerodynamics calculations; fast efficient parallel volume rendering algorithm; massively parallel distributed memory supercomputers; cell projection; maximum flexibility; data distribution; static load balancing; round robin distribution; data cells; spatial partitioning tree; image compositing step; memory consumption; communication cost; buffering messages; rendering calculations; IBM SP2; rendering rates; tetrahedral cells; pixel image; 3D unstructured data visualization VL  0 JA  Parallel Rendering Symposium ER   
Visualizing three dimensional unstructured data from aerodynamics calculations is challenging because the associated meshes are typically large in size and irregular in both shape and resolution. The goal of this research is to develop a fast, efficient parallel volume rendering algorithm for massively parallel distributed memory supercomputers consisting of a large number of very powerful processors. We use cell projection instead of ray casting to provide maximum flexibility in the data distribution and rendering steps. Effective static load balancing is achieved with a round robin distribution of data cells among the processors. A spatial partitioning tree is used to guide the rendering, optimize the image compositing step, and reduce memory consumption. Communication cost is reduced by buffering messages and by overlapping communication with rendering calculations as much as possible. Tests on the IBM SP2 demonstrate that these strategies provide high rendering rates and good scalability. For a dataset containing half a million tetrahedral cells, we achieve two frames per second for a 400/spl times/400 pixel image using 128 processors.
Index Terms:
rendering (computer graphics); scalable parallel cell projection volume rendering algorithm; three dimensional unstructured data; aerodynamics calculations; fast efficient parallel volume rendering algorithm; massively parallel distributed memory supercomputers; cell projection; maximum flexibility; data distribution; static load balancing; round robin distribution; data cells; spatial partitioning tree; image compositing step; memory consumption; communication cost; buffering messages; rendering calculations; IBM SP2; rendering rates; tetrahedral cells; pixel image; 3D unstructured data visualization
Citation:
KwanLiu Ma, T.W. Crockett, "A scalable parallel cellprojection volume rendering algorithm for threedimensional unstructured data," prs, pp.95, 1997 Parallel Rendering Symposium (PRS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.