Hierarchical Back-Face Culling

We present a sub linear algorithm for computing and culling back facing polygons that yields a signi cant performance improvement in the interactive rendering of large polygonal models The algorithm partitions a polygonal model it into hierarchical clusters based on the normals and positions of the polygons It does not explicitly compute all the back facing polygons but rather decides in expected constant time whether an entire cluster is back facing As a pre processing step the algorithm partitions the space into regions with respect to each cluster During rendering it exploits frame to frame coherence to track the view point The algorithm has been applied to a number of models and its performance is a function of number of clusters the depth of the hierarchies and the characteristics of the graphics system In practice we are able to cull of the polygons in about of the total CPU time per frame on an SGI Indigo Extreme for models composed of tens of thousands of polygons It improves the overall frame rate by as compared to hardware back face culling CR

[1]  Salim S. Abi-Ezzi,et al.  The Cone of Normals Technique for Fast Processing of Curved Patches , 1993, Comput. Graph. Forum.

[2]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[3]  V. Leitáo,et al.  Computer Graphics: Principles and Practice , 1995 .

[4]  Raimund Seidel,et al.  Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Anselmo Lastra,et al.  Interactive display of large-scale NURBS models , 1995, I3D '95.

[6]  Seth J. Teller,et al.  Global visibility algorithms for illumination computations , 1993, SIGGRAPH.

[7]  R. Schmacher,et al.  Study for Applying Computer-Generated Images to Visual Simulation: (510842009-001) , 1969 .

[8]  Steven L. Tanimoto.  A graph-theoretic real-time visible surface editing technique , 1977, SIGGRAPH '77.

[9]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[10]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[11]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[12]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[13]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[14]  Martin E. Newell,et al.  A solution to the hidden surface problem , 1972, ACM Annual Conference.

[15]  Franco P. Preparata,et al.  Computational Geometry , 1985, Texts and Monographs in Computer Science.

[16]  Turner Whitted,et al.  A 3-dimensional representation for fast rendering of complex scenes , 1980, SIGGRAPH '80.

[17]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[18]  Gavin S. P. Miller,et al.  Hierarchical Z-buffer visibility , 1993, SIGGRAPH.

[19]  Robert L. Grossman,et al.  Visibility with a moving point of view , 1994, SODA '90.