loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 IEEE Symposium on Volume Visualization and Graphics (VV 2004)
Implicit Occluders
Austin, Texas, USA
October 11-October 12
ISBN: 0-7803-8781-3
Sin?sio Pesco, University of Utah
Peter Lindstrom, University of Utah
Valerio Pascucci, University of Utah
Cl?udio T. Silva, University of Utah
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^{ - 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.
Index Terms:
isosurfaces, visibility computations, occlusion culling, marching cubes, computational geometry, volume visualization, graphics hardware algorithms
Citation:
Sin?sio Pesco, Peter Lindstrom, Valerio Pascucci, Cl?udio T. Silva, "Implicit Occluders," vv, pp.47-54, 2004 IEEE Symposium on Volume Visualization and Graphics (VV 2004), 2004
Usage of this product signifies your acceptance of the Terms of Use.