LOD visibility culling and occluder synthesis

Level-of-detail occlusion culling is a novel approach to the management of occluders that can be easily integrated into most current visibility culling algorithms. The main contribution of this paper is an algorithm that automatically generates sets of densely overlapping boxes with enhanced occlusion properties from non-convex subsets. We call this method occluder synthesis because it is not sensitive to the way the objects are tesselated but to the space enclosed by them. The extension of this technique by allowing a bounded amount of image error is also discussed. We show that visibility computations can be based on a multiresolution model which provides several representations of these occluders with varying visibility accuracy. Our tests show that occlusion performance in tesselated scenes is improved severely even if no image-error is allowed.

[1]  Daniel Cohen-Or,et al.  Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes , 1998, Comput. Graph. Forum.

[2]  Dieter Roller,et al.  CAD Tools and Algorithms for Product Design , 2000, Springer Berlin Heidelberg.

[3]  Binhai Zhu,et al.  Approximating Convex Polyhedra with Axis-Parallel Boxes , 1997, Int. J. Comput. Geom. Appl..

[4]  Dinesh Manocha,et al.  Accelerated occlusion culling using shadow frusta , 1997, SCG '97.

[5]  Pere Brunet,et al.  The visibility octree: a data structure for 3D navigation , 1999, Comput. Graph..

[6]  J. Mark Keil.  Covering Orthogonal Polygons with Non-Piercing Rectangles , 1997, Int. J. Comput. Geom. Appl..

[7]  Cláudio T. Silva,et al.  Rendering on a budget: a framework for time-critical rendering , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[8]  Pere Brunet Crosa,et al.  Data structures and algorithms for navigation in highly polygon-populated scenes , 1998 .

[9]  Joseph C. Culberson,et al.  Covering polygons is hard , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10]  Dan Roth,et al.  Finding the Largest Area Axis-parallel Rectangle in a Polygon , 1997, Comput. Geom..

[11]  Tomoyuki Nishita,et al.  Shading models for point and linear sources , 1985, TOGS.

[12]  László Neumann,et al.  Perception Based Color Image Difference , 1998, Comput. Graph. Forum.

[13]  Hanan Samet,et al.  Applications of spatial data structures , 1989 .

[14]  Chee-Keng Yap,et al.  A polynomial solution for the potato-peeling problem , 1986, Discret. Comput. Geom..

[15]  B. Chazelle,et al.  Optimal Convex Decompositions , 1985 .

[16]  David B. Kirk,et al.  Graphics Gems III , 1992 .

[17]  Nina Amenta,et al.  Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem , 1994, SCG '94.

[18]  Seth J. Teller,et al.  Real-time occlusion culling for models with large occluders , 1997, SI3D.

[19]  Xiaolin Wu.  A linear-Time Simple Bounding Volume Algorithm , 1992, Graphics Gems III.

[20]  Tiow Seng Tan,et al.  Preprocessing occlusion for real-time selective refinement , 1999, SI3D.

[21]  Reuven Bar-Yehuda,et al.  A linear time algorithm for covering simple polygons with similar rectangles , 1996, Int. J. Comput. Geom. Appl..

[22]  Carlo H. Séquin,et al.  Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.