Hierarchical Back-Face Computation
We present a sub-linear algorithm to compute the set of back-facing polygons in a polyhedral model. The algorithm partitions the model into hierarchical clusters based on the orientations and positions of the polygons. As a pre-processing step, the algorithm constructs spatial decompositions with respect to each cluster. For a sequence of back-face computations, the algorithm exploits the coherence in view-point movement to efficiently determine if it is in front of or behind a cluster. Due to coherence, the algorithm’s performance is linear in the number of clusters on average. We have applied this algorithm to speed up the rendering of polyhedral models. On average, we are able to cull almost half the polygons. The algorithm accounts for 5 – 10% of the total CPU time per frame on an SGI Indigo2 Extreme. The overall frame rate is improved by 40 – 75% as compared to the standard back-face culling implemented in hardware.
KeywordsTracking Algorithm Visibility Algorithm Primal Space Hierarchical Representation Polygonal Model
Unable to display preview. Download preview PDF.
- J. Airey, J. Rohlf, and F. Brooks. Towards image realism with interactive update rates in complex virtual building environments. In Symposium on Interactive 3D Graphics, pages 41–50, 1990Google Scholar
- W. Bouma and G. Vanecek Velocity-based collision detection. In A. Paeth, editor, Graphics Gems V, pages 380–385, Academic Press, 1995.Google Scholar
- D. P. Dobkin and D. G. Kirkpatrick Fast detection of polyhedral intersection. In Proc. 9th Internat. Colloq. Automata Lang. Program., volume 140 of Lecture Notes in Computer Science, pages 154–165. Springer-Verlag, 1982.Google Scholar
- J. Foley, A Van Dam, J. Hughes, and S Feiner. Computer Graphics: Principles and Practice Addison Wesley, Reading, Mass., 1990Google Scholar
- N. Greene, M. Kass, and G. Miller. Hierarchical z-buffer visibility. In Proc. of ACM Siggraph, pages 231–238, 1993Google Scholar
- S. Kumar and D Manocha. Hierarchical visibility culling for spline models. In Proceedings of Graphics Interface, pages 142–150, Totonto, Canada, 1996Google Scholar
- M. Newell, R. Newell, and T. Sancha. A new solution to the hidden surface problem. Proc. ACM Ann. Conf., pages 443–448, 1972.Google Scholar
- F.P Preparata and M I Shamos Computational Geometry. Springer-Verlag, New York, 1985.Google Scholar
- R. Schumacker, B. Brand, M Gilliland, and W. Sharp. Study for applying computer-generated images to visual generation. Technical report, AFHRL-TR-69-74, US Air Force Human Resources Lab, 1969.Google Scholar
- L.A. Shirman and S.S. Abi-Ezzi. The cone of normals technique for fast processing of curved patches. In EUROGRAPHICS, pages 261–272, 1993.Google Scholar
- S.L. Tanimoto. A graph-theoretic real-time visible surface editing technique. In Proc. of ACM Siggraph, pages 223–228, 1977.Google Scholar
- S J. Teller. Visibility Computations in Densely Occluded Polyheral Environments. PhD thesis, CS Division, UC Berkeley, 1992.Google Scholar