Optimized subdivisions for preprocessed visibility

Proceedings - Graphics Interface

Volumn , Issue , 2007, Pages 335-342

  Mattausch, Oliver ^a   Bittner, Jiří ^a,b   Wonka, Peter ^c   Wimmer, Michael ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^c ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Potentially visible sets; Visibility preprocessing

Indexed keywords

DATA STRUCTURES; INFORMATION ANALYSIS; OPTIMIZATION; STATE SPACE METHODS;

OBJECT SPACE SUBDIVISIONS; POTENTIALLY VISIBLE SETS; VISIBILITY PREPROCESSING;

VISIBILITY;

EID: 34547968121     PISSN: 07135424     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1268517.1268571     Document Type: Conference Paper

References (21)

1. Timo Aila. Surrender umbra: A visibility determination framework for dynamic environments. Master's thesis, Helsinki University of Technology, 2000.
2. John M. Airey, John H. Rohlf, and Frederick P. Brooks, Jr. Towards image realism with interactive update rates in complex virtual building environments. In 1990 Symposium on Interactive 3D Graphics, pages 41-50. ACM SIGGRAPH, March 1990.
3. William V. Baxter JH, Avneesh Sud, Naga K. Govindaraju, and Dinesh Manocha. GigaWalk: Interactive walkthrough of complex environments. In Simon Gibson and Paul Debevec, editors, Proceedings of the 13th Eurographics Workshop on Rendering (RENDERING TECHNIQUES-02), pages 203-214, Aire-la-Ville, Switzerland, June 26-28 2002. Eurographics Association.
4. Jiří Bittner and Peter Wonka. Visibility in computer graphics. Environment and Planning B: Planning and Design, 30(5):729-756, sep 2003.
5. D. Cohen-Or, Y. Chrysanthou, C. Silva, and F. Durand. A survey of visibility for walkthrough applications. IEEE Transactions on Visualization and Computer Graphics., 2002.
6. Craig Gotsman, Oded Sudarsky, and Jeffrey A. Fayman. Optimized occlusion culling using five-dimensional subdivision. Computers and Graphics, 23(5):645-654, October 1999.
7. Denis Haumont, Olivier Debeir, and Franois Sillion. Volumetric cell-and-portal generation. Computer Graphics Forum, 22(3):303-312, September 2003.
8. Vlastimil Havran. Heuristic Ray Shooting Algorithms. Ph.d. thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, November 2000.
9. Michael Kortenjan and Gunnar Schomaker. Size equivalent cluster trees (sec-trees) realtime rendering of large industrial scenes. In Afrigaph '06: Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa, pages 107-116, New York, NY, USA, 2006. ACM Press.
10. A. Lerner, D. Cohen-Or, and Y. Chrysanthou. Breaking the walls: Scene partitioning and portal creation. In Pacific Graphics, 2003.
11. David Luebke and Chris Georges. Portals and mirrors: Simple, fast evaluation of potentially visible sets. In Pat Hanrahan and Jim Winget, editors, 1995 Symposium on Interactive 3D Graphics, pages 105-106. ACM SIGGRAPH, April 1995.
12. J. David MacDonald and Kellogg S. Booth. Heuristics for ray tracing using space subdivision. Visual Computer, 6(6): 153-65, 1990. criteria for building octree (actually BSP) efficiency structures.
13. Silvano Martello and Paolo Toth. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons Inc., New York, 1990.
14. Oliver Mattausch, Jiří Bittner, and Michael Wimmer. Adaptive visibility-driven view cell construction. In Wolfgang Heidrich and Tomas Akenine-Moller, editors, Rendering Techniques 2006 (Proceedings of the Eurographics Symposium on Rendering 2006), pages 195-206. Eurographics, Eurographics Association, June 2006.
15. Daniel Meneveaux, Kadi Bouatouch, Eric Maisel, and R. Delmont. A new partitioning method for architectural environments. Journal of Visualization and Computer Animation, 9(4):195-213, 1998.
16. S. Nirenstein and E. Blake. Hardware accelerated aggressive visibility preprocessing using adaptive sampling. In Rendering Technqiues 2004, pages 207-216, 2004.
17. C. Saona-Vázquez, I. Navazo, and P. Brunet. The visibility octree: a data structure for 3D navigation. Computers and Graphics, 23(5):635-643, October 1999.
18. S. J. Teller and C. H. Séquin. Visibility preprocessing for interactive walkthroughs. In Proceedings of SIGGRAPH '91, pages 61-69, July 1991.
19. Seth Jared Teller. Visibility Computations in Densely Occluded Polyhedral Environments. PhD thesis, Dept. of Computer Science, University of California, Berkeley, 1992. Also available as Technical Report UCB//CSD-92-708.
20. Michiel van de Panne and A. James Stewart. Effective compression techniques for precomputed visibility. In Rendering Techniques, pages 305-316, 1999.
21. Michael Wimmer and Peter Wonka. Rendering time estimation for real-time rendering. In Rendering Techniques, pages 118-129, 2003.