Abstract
We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the `disconnectedness' decreases. The algorithm is carefully tailored to exploit spatial coherence even if the image resolution differs substantially from the object space resolution. In this paper, we establish the practicality of our method through experimental results based on our implementation, and we also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the Symposium on Volume Visualization |
| Publisher | ACM |
| Pages | 15-22 |
| Number of pages | 8 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 Symposium on Volume Visualization - San Francisco, CA, USA Duration: Oct 28 1996 → Oct 29 1996 |
Other
| Other | Proceedings of the 1996 Symposium on Volume Visualization |
|---|---|
| City | San Francisco, CA, USA |
| Period | 10/28/96 → 10/29/96 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
Cite this
Fast rendering of irregular grids. / Silva, Claudio T.; Mitchell, Joseph S B; Kaufman, Arie E.
Proceedings of the Symposium on Volume Visualization. ACM, 1996. p. 15-22.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Fast rendering of irregular grids
AU - Silva, Claudio T.
AU - Mitchell, Joseph S B
AU - Kaufman, Arie E.
PY - 1996
Y1 - 1996
N2 - We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the `disconnectedness' decreases. The algorithm is carefully tailored to exploit spatial coherence even if the image resolution differs substantially from the object space resolution. In this paper, we establish the practicality of our method through experimental results based on our implementation, and we also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.
AB - We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the `disconnectedness' decreases. The algorithm is carefully tailored to exploit spatial coherence even if the image resolution differs substantially from the object space resolution. In this paper, we establish the practicality of our method through experimental results based on our implementation, and we also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.
UR - http://www.scopus.com/inward/record.url?scp=0030382261&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030382261&partnerID=8YFLogxK
M3 - Conference contribution
SP - 15
EP - 22
BT - Proceedings of the Symposium on Volume Visualization
PB - ACM
ER -