Implicit Occluders

Sinésio Pesco, Peter Lindstrom, Valerio Pascucci, Cláudio T. Silva

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

Abstract

In this paper we propose a novel visibility-culling technique for optimizing the computation and rendering of opaque isosurfaces. Given a continuous scalar field f(x) over a domain D and an isovalue w, our technique exploits the continuity of / to determine conservative visibility bounds implicitly, i.e., without the need for actually computing the isosurface f -1 (w). We generate Implicit Occluders based on the change in sign of f* (x) = f(x) -w, from positive to negative (or vice versa) in the neighborhood of the isosurface. Consider, for example, the sign of f* along a ray r cast from the current viewpoint. The first change in sign of f* within D must contain an intersection of r with the isosurface. Any additional intersection of the isosurface with r is not visible. Implicit Occluders constitute a general concept that can be exploited algorithmically in different ways depending on the framework adopted for visibility computations. In this paper, we propose a simple from-point approach that exploits well-known hardware occlusion queries.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004
EditorsD. Silver, T. Ertl, C. Silva
Pages47-54
Number of pages8
StatePublished - 2004
EventProceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004 - Austin, TX, United States
Duration: Oct 11 2004Oct 12 2004

Other

OtherProceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004
CountryUnited States
CityAustin, TX
Period10/11/0410/12/04

Fingerprint

Visibility
Hardware

Keywords

  • Computational geometry
  • Graphics hardware algorithms
  • Isosurfaces
  • Marching cubes
  • Occlusion culling
  • Visibility computations
  • Volume visualization

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Pesco, S., Lindstrom, P., Pascucci, V., & Silva, C. T. (2004). Implicit Occluders. In D. Silver, T. Ertl, & C. Silva (Eds.), Proceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004 (pp. 47-54)

Implicit Occluders. / Pesco, Sinésio; Lindstrom, Peter; Pascucci, Valerio; Silva, Cláudio T.

Proceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004. ed. / D. Silver; T. Ertl; C. Silva. 2004. p. 47-54.

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

Pesco, S, Lindstrom, P, Pascucci, V & Silva, CT 2004, Implicit Occluders. in D Silver, T Ertl & C Silva (eds), Proceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004. pp. 47-54, Proceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004, Austin, TX, United States, 10/11/04.
Pesco S, Lindstrom P, Pascucci V, Silva CT. Implicit Occluders. In Silver D, Ertl T, Silva C, editors, Proceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004. 2004. p. 47-54
Pesco, Sinésio ; Lindstrom, Peter ; Pascucci, Valerio ; Silva, Cláudio T. / Implicit Occluders. Proceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004. editor / D. Silver ; T. Ertl ; C. Silva. 2004. pp. 47-54
@inproceedings{61277ec5807d4197b60face3c8556b34,
title = "Implicit Occluders",
abstract = "In this paper we propose a novel visibility-culling technique for optimizing the computation and rendering of opaque isosurfaces. Given a continuous scalar field f(x) over a domain D and an isovalue w, our technique exploits the continuity of / to determine conservative visibility bounds implicitly, i.e., without the need for actually computing the isosurface f -1 (w). We generate Implicit Occluders based on the change in sign of f* (x) = f(x) -w, from positive to negative (or vice versa) in the neighborhood of the isosurface. Consider, for example, the sign of f* along a ray r cast from the current viewpoint. The first change in sign of f* within D must contain an intersection of r with the isosurface. Any additional intersection of the isosurface with r is not visible. Implicit Occluders constitute a general concept that can be exploited algorithmically in different ways depending on the framework adopted for visibility computations. In this paper, we propose a simple from-point approach that exploits well-known hardware occlusion queries.",
keywords = "Computational geometry, Graphics hardware algorithms, Isosurfaces, Marching cubes, Occlusion culling, Visibility computations, Volume visualization",
author = "Sin{\'e}sio Pesco and Peter Lindstrom and Valerio Pascucci and Silva, {Cl{\'a}udio T.}",
year = "2004",
language = "English (US)",
isbn = "0780387813",
pages = "47--54",
editor = "D. Silver and T. Ertl and C. Silva",
booktitle = "Proceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004",

}

TY - GEN

T1 - Implicit Occluders

AU - Pesco, Sinésio

AU - Lindstrom, Peter

AU - Pascucci, Valerio

AU - Silva, Cláudio T.

PY - 2004

Y1 - 2004

N2 - In this paper we propose a novel visibility-culling technique for optimizing the computation and rendering of opaque isosurfaces. Given a continuous scalar field f(x) over a domain D and an isovalue w, our technique exploits the continuity of / to determine conservative visibility bounds implicitly, i.e., without the need for actually computing the isosurface f -1 (w). We generate Implicit Occluders based on the change in sign of f* (x) = f(x) -w, from positive to negative (or vice versa) in the neighborhood of the isosurface. Consider, for example, the sign of f* along a ray r cast from the current viewpoint. The first change in sign of f* within D must contain an intersection of r with the isosurface. Any additional intersection of the isosurface with r is not visible. Implicit Occluders constitute a general concept that can be exploited algorithmically in different ways depending on the framework adopted for visibility computations. In this paper, we propose a simple from-point approach that exploits well-known hardware occlusion queries.

AB - In this paper we propose a novel visibility-culling technique for optimizing the computation and rendering of opaque isosurfaces. Given a continuous scalar field f(x) over a domain D and an isovalue w, our technique exploits the continuity of / to determine conservative visibility bounds implicitly, i.e., without the need for actually computing the isosurface f -1 (w). We generate Implicit Occluders based on the change in sign of f* (x) = f(x) -w, from positive to negative (or vice versa) in the neighborhood of the isosurface. Consider, for example, the sign of f* along a ray r cast from the current viewpoint. The first change in sign of f* within D must contain an intersection of r with the isosurface. Any additional intersection of the isosurface with r is not visible. Implicit Occluders constitute a general concept that can be exploited algorithmically in different ways depending on the framework adopted for visibility computations. In this paper, we propose a simple from-point approach that exploits well-known hardware occlusion queries.

KW - Computational geometry

KW - Graphics hardware algorithms

KW - Isosurfaces

KW - Marching cubes

KW - Occlusion culling

KW - Visibility computations

KW - Volume visualization

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

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

M3 - Conference contribution

SN - 0780387813

SN - 9780780387812

SP - 47

EP - 54

BT - Proceedings - IEEE Symposium on Volume Visualization and Graphics 2004. VolVis 2004

A2 - Silver, D.

A2 - Ertl, T.

A2 - Silva, C.

ER -