Fast rendering of irregular grids

Claudio T. Silva; Joseph S.B. Mitchell; Arie E. Kaufman

Fast rendering of irregular grids

Stony Brook University

Stony Brook University

Research output: Contribution to conference › Paper › peer-review

15 Scopus citations

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
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

Conference

Conference	Proceedings of the 1996 Symposium on Volume Visualization
City	San Francisco, CA, USA
Period	10/28/96 → 10/29/96

Cite this

@conference{cd6a3bf6bb6c42a983d54691d8619d9c,

title = "Fast rendering of irregular grids",

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.",

author = "Silva, \{Claudio T.\} and Mitchell, \{Joseph S.B.\} and Kaufman, \{Arie E.\}",

year = "1996",

language = "English",

pages = "15--22",

note = "Proceedings of the 1996 Symposium on Volume Visualization ; Conference date: 28-10-1996 Through 29-10-1996",

}

TY - CONF

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 - https://www.scopus.com/pages/publications/0030382261

M3 - Paper

SP - 15

EP - 22

T2 - Proceedings of the 1996 Symposium on Volume Visualization

Y2 - 28 October 1996 through 29 October 1996

ER -

Fast rendering of irregular grids

Abstract

Conference

Other files and links

Fingerprint

Cite this