Title :
Implicit occluders
Author :
Pesco, S. ; Lindstrom, P. ; Pascucci, V. ; Silva, C.T.
Author_Institution :
Utah Univ., USA
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 iso-value w, our technique exploits the continuity of f to determine conservative visibility bounds implicitly, i.e., without the need for actually computing the isosurface f/sup 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; computer graphics; computational geometry; graphics hardware algorithms; hardware occlusion queries; implicit occluders; isosurface neighborhood; marching cubes; occlusion culling; opaque isosurface computation; opaque isosurface rendering; visibility-culling technique; volume visualization; Chromium; Computational geometry; Computer displays; Computer graphics; Hardware; Isosurfaces; Laboratories; Pervasive computing; Scientific computing; Visualization; computational geometry; graphics hardware algorithms; isosurfaces; marching cubes; occlusion culling; visibility computations; volume visualization;
Conference_Titel :
Volume Visualization and Graphics, 2004 IEEE Symposium on
Conference_Location :
Austin, TX, USA
Print_ISBN :
0-7803-8781-3
DOI :
10.1109/SVVG.2004.5