Hierarchical back-face computation

Computers and Graphics (Pergamon)

Volumn 23, Issue 5, 1999, Pages 681-692

  Kumar, Subodh ^a   Manocha, Dinesh ^b   Garrett, William ^c   Lin, Ming ^b  

^a Johns Hopkins University   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

^c HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FACINGS; GEOMETRY; HIERARCHICAL SYSTEMS;

ALGORITHM PARTITION; COMPUTATION ALGORITHM; EXPECTED RUNNING TIME; LINEAR ALGORITHMS; NUMBER OF CLUSTERS; POLYHEDRAL MODELING; PRE-PROCESSING STEP; SPATIAL DECOMPOSITIONS;

CLUSTERING ALGORITHMS;

EID: 0346966912     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(99)00091-6     Document Type: Article

References (24)

1. Foley J, VanDam A, Feiner S, Hughes J. Computer graphics principles and practice. Menlo Park, California: Addison-Wesley, 1993.
2. Crow FC. Shadow algorithms for computer graphics. ACM Computer Graphics 1977;11(3):242-8 (SIGGRAPH Proceedings).
3. Bouma W, Vanecek G. Velocity-based collision detection. In: Paeth A, editor. Graphics gems V. New York: Academic Press, 1995. p. 380-5.
4. Bern M, Dobkin D, Eppstein D, Grossman R. Visibility with a moving point of view. Algorithmica 1994;11:360-78.
5. Fuchs H, Kedem Z, Naylor B. On Visible Surface Generation by a Priority Tree Structure. In Proceedings of ACM SIGGRAPH, 1980. p. 124-33.
6. Sutherland I, Sproull R, Schumaker R. A Characterization of Ten Hidden-surface Algorithms. ACM Computing Surveys 1974;6(1):1-55.
7. Schumacker R, Brand B, Gilliland M, Sharp W. Study for applying computer-generated images to visual generation. Technical Report, AFHRL-TR-69-74, US Air Force Human Resources Lab, 1969.
8. Newell M, Newell R, Sancha T. A new solution to the hidden surface problem. Proceedings of ACM Annual Conference, 1972. p. 443-8.
9. Clark JH. Hierarchical geometric models for visible surface algorithms. Communications of the ACM 1976;19(10):547-54.
10. Airey J, Rohlf J, Brooks F. Towards image realism with interactive update rates in complex virtual building environments. ACM Computer Graphics 1990;24(2):41-50 (In Symposium on Interactive 3D Graphics).
11. Teller SJ. Visibility computations in densely occluded polyhedral environments. PhD thesis, CS Division, UC Berkeley, 1992.
12. Greene N, Kass M, Miller G. Hierarchical Z-buffer visibility. In Proceedings of ACM SIGGRAPH, 1993. p. 231-8.
13. Zhang H, Manocha D, Hudson T, Hoff K. Visibility culling using hierarchical occlusion maps. In Proceedings of ACM SIGGRAPH, 1997. p. 77-88.
14. Gigus Z, Canny J, Seidel R. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence 1991;13(6):542-51.
15. Coorg S, Teller S. Temporally coherent conservative visibility. In Proceedings of 12th Annual ACM Symposium on Computational Geometry, 1996. p. 78-87.
16. Durand F, Drettakis G, Puech C. The visibility skeleton: a powerful and efficient multi-purpose global visibility tool. In Proceedings of ACM SIGGRAPH, 1997. p. 89-100.
17. Kumar S, Manocha D. Hierarchical visibility culling for spline models. In Proceedings of Graphics Interface, Toronto, Canada, 1996. p. 142-50.
18. Shirman LA, Abi-Ezzi SS. The cone of normals technique for fast processing of curved patches. In EUROGRAPHICS, 1993. p. 261-72.
19. Tanimoto SL. A graph-theoretic real-time visible surface editing technique. In Proceedings of ACM SIGGRAPH, 1977. p. 223-8.
20. Preparata FP, Shamos MI. Computational geometry. New York: Springer, 1985.
21. Barber B, Dobkin D, Huhdanpaa H. The quickhull algorithm for convex hull. Technical Report GCG53, The Geometry Center, MN, 1993.
22. Seidel R. Linear programming and convex hulls made easy. In Proceedings of 6th Annual ACM Conference on Computational Geometry, Berkeley, California, 1990. p. 211-5.
23. Dobkin DP, Kirkpatrick DG. Fast detection of polyhedral intersection. In:. Proceedings of 9th International Colloquim Automata Lang. Program., Lecture Notes in Computer Science, vol. 140. Berlin: Springer, 1982. p. 154-65.
24. Durand F, Puech C. The visibility complex made visibly simple. In Proceedings of 11th Annual ACM Symposium Computational Geometry, 1995. p. V2.