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

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fast rendering of irregular grids'. Together they form a unique fingerprint.

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