Fast rendering of irregular grids

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationProceedings of the Symposium on Volume Visualization
PublisherACM
Pages15-22
Number of pages8
StatePublished - 1996
EventProceedings of the 1996 Symposium on Volume Visualization - San Francisco, CA, USA
Duration: Oct 28 1996Oct 29 1996

Other

OtherProceedings of the 1996 Symposium on Volume Visualization
CitySan Francisco, CA, USA
Period10/28/9610/29/96

Fingerprint

Casting
Optical resolving power
Image resolution
Costs

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Silva, C. T., Mitchell, J. S. B., & Kaufman, A. E. (1996). Fast rendering of irregular grids. In Proceedings of the Symposium on Volume Visualization (pp. 15-22). ACM.

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

Silva, CT, Mitchell, JSB & Kaufman, AE 1996, Fast rendering of irregular grids. in Proceedings of the Symposium on Volume Visualization. ACM, pp. 15-22, Proceedings of the 1996 Symposium on Volume Visualization, San Francisco, CA, USA, 10/28/96.
Silva CT, Mitchell JSB, Kaufman AE. Fast rendering of irregular grids. In Proceedings of the Symposium on Volume Visualization. ACM. 1996. p. 15-22
Silva, Claudio T. ; Mitchell, Joseph S B ; Kaufman, Arie E. / Fast rendering of irregular grids. Proceedings of the Symposium on Volume Visualization. ACM, 1996. pp. 15-22
@inproceedings{fc03b1b671ac42adb181621ba58d45da,
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 (US)",
pages = "15--22",
booktitle = "Proceedings of the Symposium on Volume Visualization",
publisher = "ACM",

}

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 -