TY - GEN
T1 - Simple, fast, and robust ray casting of irregular grids
AU - Bunyk, P.
AU - Kaufman, A.
AU - Silva, C. T.
N1 - Funding Information:
NASA has gracefully provided the Blunt Fin, Liquid Oxygen Post, and Delta Wing datasets. The Combustion Chamber dataset is from the Visualization Toolkit (Vtk). We thank D. Zinoviev and P. Shevchenko for their idea of Point-Within-Triangle algorithm. This project has been partially supported by National Science Foundation grant MIP-9527694, and by grants from NASA Ames, the Office of Naval Research grant N000149710402 , Sandia National Labs and the Dept of Energy Mathematics, Information and Computer Science Office.
Publisher Copyright:
© 1997 IEEE Computer Society.
PY - 1997
Y1 - 1997
N2 - In this paper we describe a simple and efficient ray casting engine that is suitable for the rapid exploration of irregular grids composed of tetrahedra cells, or other cell complexes where cells have been broken up into faces. In our method, in a preprocessing phase, all the cells are broken into their corresponding faces. Visibility determination is performed after all the faces have been transformed into screen space; here we compute for each pixel an ordered list of the stabbing boundary faces. The final phase is the actual ray casting, which is performed independently for each pixel, and is basically a walk in the cell complex inside each component of the stabbing ordered list. For color calculations, a simple analytical lighting model is applied to each intersection of ray and cell. Our algorithm is simple, and our implementation fast and robust.
AB - In this paper we describe a simple and efficient ray casting engine that is suitable for the rapid exploration of irregular grids composed of tetrahedra cells, or other cell complexes where cells have been broken up into faces. In our method, in a preprocessing phase, all the cells are broken into their corresponding faces. Visibility determination is performed after all the faces have been transformed into screen space; here we compute for each pixel an ordered list of the stabbing boundary faces. The final phase is the actual ray casting, which is performed independently for each pixel, and is basically a walk in the cell complex inside each component of the stabbing ordered list. For color calculations, a simple analytical lighting model is applied to each intersection of ray and cell. Our algorithm is simple, and our implementation fast and robust.
UR - http://www.scopus.com/inward/record.url?scp=85060878878&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85060878878&partnerID=8YFLogxK
U2 - 10.1109/dagstuhl.1997.1423099
DO - 10.1109/dagstuhl.1997.1423099
M3 - Conference contribution
AN - SCOPUS:85060878878
T3 - Scientific Visualization Conference, dagstuhl 1997
SP - 30
EP - 36
BT - Scientific Visualization Conference, dagstuhl 1997
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1997 Scientific Visualization Conference, dagstuhl 1997
Y2 - 9 June 1997 through 13 June 1997
ER -