The lazy sweep ray casting algorithm for rendering irregular grids

Claudio T. Suva, Joseph S B Mitchell

Research output: Contribution to journalArticle

Abstract

Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including 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. Lazy Sweep Ray Casting has several desirable properties, including its generality, (depth-sorting) accuracy, low memory consumption, speed, simplicity of implementation, and portability (e.g., no hardware dependencies). We establish the practicality of our method through experimental results based on our implementation, which is shown to be substantially faster (by up to two orders of magnitude) than other algorithms implemented in software. We also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.

Original languageEnglish (US)
Pages (from-to)142-157
Number of pages16
JournalIEEE Transactions on Visualization and Computer Graphics
Volume3
Issue number2
DOIs
StatePublished - 1997

Fingerprint

Casting
Optical resolving power
Image resolution
Sorting
Hardware
Data storage equipment
Costs

Keywords

  • Computational geometry
  • Irregular grids
  • Ray tracing
  • Scientific visualization
  • Sweep algorithms
  • Volume rendering
  • Volumetric data

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

The lazy sweep ray casting algorithm for rendering irregular grids. / Suva, Claudio T.; Mitchell, Joseph S B.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 3, No. 2, 1997, p. 142-157.

Research output: Contribution to journalArticle

@article{adfa9c2238f6483caaf0156fc4917cd0,
title = "The lazy sweep ray casting algorithm for rendering irregular grids",
abstract = "Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including 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. Lazy Sweep Ray Casting has several desirable properties, including its generality, (depth-sorting) accuracy, low memory consumption, speed, simplicity of implementation, and portability (e.g., no hardware dependencies). We establish the practicality of our method through experimental results based on our implementation, which is shown to be substantially faster (by up to two orders of magnitude) than other algorithms implemented in software. We also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.",
keywords = "Computational geometry, Irregular grids, Ray tracing, Scientific visualization, Sweep algorithms, Volume rendering, Volumetric data",
author = "Suva, {Claudio T.} and Mitchell, {Joseph S B}",
year = "1997",
doi = "10.1109/2945.597797",
language = "English (US)",
volume = "3",
pages = "142--157",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - The lazy sweep ray casting algorithm for rendering irregular grids

AU - Suva, Claudio T.

AU - Mitchell, Joseph S B

PY - 1997

Y1 - 1997

N2 - Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including 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. Lazy Sweep Ray Casting has several desirable properties, including its generality, (depth-sorting) accuracy, low memory consumption, speed, simplicity of implementation, and portability (e.g., no hardware dependencies). We establish the practicality of our method through experimental results based on our implementation, which is shown to be substantially faster (by up to two orders of magnitude) than other algorithms implemented in software. We also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.

AB - Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including 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. Lazy Sweep Ray Casting has several desirable properties, including its generality, (depth-sorting) accuracy, low memory consumption, speed, simplicity of implementation, and portability (e.g., no hardware dependencies). We establish the practicality of our method through experimental results based on our implementation, which is shown to be substantially faster (by up to two orders of magnitude) than other algorithms implemented in software. We also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.

KW - Computational geometry

KW - Irregular grids

KW - Ray tracing

KW - Scientific visualization

KW - Sweep algorithms

KW - Volume rendering

KW - Volumetric data

UR - http://www.scopus.com/inward/record.url?scp=0031123058&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031123058&partnerID=8YFLogxK

U2 - 10.1109/2945.597797

DO - 10.1109/2945.597797

M3 - Article

AN - SCOPUS:0031123058

VL - 3

SP - 142

EP - 157

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 2

ER -