Hierarchical Visibility in Terrains
This paper describes a hierarchical visibility technique that significantly accelerates terrain rendering. With this technique, large parts of the terrain that are hidden from the viewpoint are culled, thus avoiding the expense of uselessly sending them down the graphics pipeline (only to find in the z—buffer step that they are hidden). The hierarchical visibility technique has been implemented in a multiresolution terrain rendering algorithm and experimental results show very large speedups in some situations.
KeywordsVisibility Test Horizon Point Occlusion Region Triangulate Irregular Network Constrain Delaunay Triangulation
Unable to display preview. Download preview PDF.
- 1.P. Lindstrom, D. Koller, W. Ribarsky, L. F. Hughes, N. Faust, and G. Turner, “Real-Time, continuous level of detail rendering of height fields”, in Computer Graphics (SIGGRAPH ‘86 Proceedings). ACM SIGGRAPH, August 1996, pp. 109–118, held in New Orleans, Louisiana, 04–09 August 1996.Google Scholar
- 4.M. H. Gross, R. Gatti, and O. Staadt, “Fast multiresolution surface meshing”, in Proceedings of Visualization ‘85, October 1995, pp. 135–142.Google Scholar
- 9.Satyan Coorg and Seth Teller, “Temporally coherent conservative visibility”, in Proc. 12th Annu. ACM Sympos. Comput. Geom.,1996, pp. 78–87.Google Scholar
- 10.Seth J. Teller and Carlo H. Séquin, “Visibility preprocessing for interactive walk-throughs”, in Computer Graphics (SIGGRAPH ‘81 Proceedings), Thomas W. Sederberg, Thomas W. July 1991, vol. 25, pp. 61–69.Google Scholar
- 11.Seth J. Teller, “Computing the antipenumbra of an area light source”, in Computer Graphics (SIGGRAPH ‘82 Proceedings), Edwin E. Catmull, Edwin E. July 1992, vol. 26, pp. 139–148.Google Scholar
- 12.H-M Chen and W-T Wang, “The feudal priority algorithm on hidden-surface removal”, in Computer Graphics (SIGGRAPH ‘86 Proceedings), August 1996, pp. 55–64, held in New Orleans, Louisiana, 04–09 August 1996.Google Scholar
- 13.Donald J. Meagher, “Efficient synthetic image generation of arbitrary 3-D objects”, in Proceedings of the IEEE Conference on Pattern Recognition and Image Processing, June 1982, pp. 473–478.Google Scholar
- 14.Ned Greene, Michael Kass, and Gavin Miller, “Hierarchical Z-buffer visibility”, in Computer Graphics (SIGGRAPH ‘83 Proceedings), James T. Kajiya, James T. Aug. 1993, vol. 27, pp. 231–238.Google Scholar
- 15.M. de Berg and K. Dobrindt, “On levels of detail in terrains”, in Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. C26–C27.Google Scholar
- 19.Daniel R. Baum, Stephen Mann, Kevin P. Smith, and James M. Winget, “Making radiosity usable: Automatic preprocessing and meshing techniques for the generation of accurate radiosity solutions”, in Computer Graphics (SIGGRAPH ‘81 Proceedings), Thomas W. Sederberg, Thomas W. July 1991, vol. 25, pp. 51–60.Google Scholar
- 22.A. James Stewart, “Fast horizon computation for accurate terrain rendering”, Tech. Rep. TR 349, Department of Computer Science, University of Toronto, June 1996, available from http://www.dgp.toronto.edu/people/JamesStewart