Real-time massive model rendering

Synthesis Lectures on Computer Graphics and Animation

Volumn 7, Issue , 2008, Pages 111-112

  Yoon, Sung Eui ^a   Gobbetti, Enrico ^b   Kasik, David ^c   Manocha, Dinesh ^d  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b CRS4 ^*

^c BOEING COMPANY   (United States)

^d UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Cache coherent data management; Collision detection; Interactive visualization and rendering; Large scale rendering; Levels of detail (LOD); Massive model rendering; Multi resolution rendering; Rasterization; Ray tracing; Simplification; Visibility computation

Indexed keywords

3-D MODELING; CACHE-COHERENT DATA MANAGEMENT; COHERENT DATA; COLLISION DETECTION; COMMODITY HARDWARE; COMPLEX MODELING; COMPUTING POWERS; DATA SETS; GEOMETRIC MODELLING; INTERACTIVE APPLICATIONS; INTERACTIVE DISPLAYS; INTERACTIVE VISUALIZATION AND RENDERING; INTERACTIVE VISUALIZATIONS; LARGE-SCALE RENDERING; LEVELS OF DETAILS; LEVELS-OF-DETAIL (LOD); MASSIVE MODEL RENDERING; MODEL COMPLEXITY; MULTI-RESOLUTION RENDERING; RASTERIZATION; RAY TRACING; SCIENTIFIC VISUALIZATION; SIMPLIFICATION; VIRTUAL PROTOTYPING; VISIBILITY COMPUTATION; VISIBILITY COMPUTATIONS;

CHLORINE COMPOUNDS; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; DATA VISUALIZATION; INTERACTIVE COMPUTER GRAPHICS; SOFTWARE PROTOTYPING; THREE DIMENSIONAL; TRIANGULATION; VISUALIZATION;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 48949089742     PISSN: 19338996     EISSN: 19339003     Source Type: Book Series    
DOI: 10.2200/S00131ED1V01Y200807CGR007     Document Type: Review

References (224)

1. +01] M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C.T. Silva. Point Set Surfaces. In Proceedings of IEEE Visualization 2001, pp. 21-28, 2001. DOI: 10.1109/VISUAL.2001.964489
2. +03] S. Alstrup, M.A. Bende, E.D. Demaine, M. Farach-Colton, T. Rauhe, and M. Thorup. Efficient tree layout in amultilevel memory hierarchy. Computing Research Repository (CoRR), 2003.
3. [ABF04] L. Arge, G. Brodal, and R. Fagerberg. Cache oblivious data structures. Handbook on Data Structures and Applications, ACM, New York, NY, 2004.
4. +99] D. Aliaga, J. Cohen, A. Wilson, H. Zhang, C. Erikson, K. Hoff, T. Hudson, W. Stuerzlinger, E. Baker, R. Bastos, M. Whitton, F. Brooks, and D. Manocha. MMR: An integrated massive model rendering system using geometric and image-based acceleration. In Proceedings of ACM Symposium on Interactive 3D Graphics, pp. 199-206, 1999. DOI: 10.1145/300523.300554
5. [AL97] D.G. Aliaga and A.A. Lastra. Architectural Walkthroughs Using Portal Textures. In Proceedings of IEEE Visualization 1997, pp. 355-362, 1997. DOI: 10.1109/VISUAL.1997.663903
6. [AM96] R. Abarbanel and W. McNeely. Flythru the boeing 777. ACM SIGGRAPH Visual Proceeding, 1996. DOI: 10.1145/253607.253800
7. [AM00] U. Assarsson and T. Möller. Optimized view frustum culling algorithms for bounding boxes. Journal of Graphic Tools, 5, 2000.
8. [Ame07] The american heritage dictionary of the english language. Houghton Mifflin Company, Boston, MA, 2007.
9. [AMH02] T. Akenine-Möller and E. Haines. Real-Time Rendering, Second Edition. A K Peters, Wellesley, MA, 2002.
10. [App68] A. Appel. Some techniques for shading machine renderings of solids. In AFIPS 1968 Spring Joint Computer Conf., volume 32, pp. 37-45, 1968.
11. [ARB90] J.M. Airey, J.H. Rohlf, and F.P. Brooks, Jr. Towards image realism with interactive update rates in complex virtual building environments. Computer Graphics 24(2):41-50, March 1990. DOI: 10.1145/91385.91416
12. [AS94] P.K. Agarwal and S. Suri. Surface approximation and geometric partitions. In Proceedings 5th ACM-SIAM Sympos. Discrete Algorithms, pp. 24-33, 1994. DOI: 10.1137/S0097539794269801
13. [ASNB00] C. Andujar, C. Saona, I. Navazo, and P. Brunet. Integrating occlusion culling and levels of detail through hardly-visible sets. Computer Graphics Forum, 19(3):499-506, 2000. DOI: 10.1111/1467-8659.00442
14. [ASVN00] C. Andújar, C. Saona-Vázquez, and I. Navazo. LOD visibility culling and occluder synthesis. Computer-Aided Design, 32(13):773-783, October 2000. DOI: 10.1016/S0010-4485(00)00067-1
15. [AV88] A. Aggarwal and J.S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31:1116-1127, 1988. DOI: 10.1145/48529.48535
16. [BD06] L. Baboud and X. Décoret.:: Rendering geometry with relief textures. In C. Gutwin and S. Mann, Eds., Graphics Interface, pp. 195-201. Canadian Human-Computer Communications Society, 2006.
17. [BG02] A. Bogomjakov and C. Gotsman. Universal rendering sequences for transparent vertex caching of progressive meshes. In Computer Graphics Forum, pp. 137-148, 2002. DOI: 10.1111/1467-8659.00573
18. +07] L. Borgeat, G. Godin, P. Massicotte, G. Poirier, F. Blais, and J. Beraldin. Analyzing large multi-scale datasets: The case of the virtual mona lisa. IEEE Computer Graphics and Applications, 2007. DOI: 10.1109/MCG.2007.162
19. [BGMP07] F. Bettio, E. Gobbetti, F. Marton, and G. Pintore. High-quality networked terrain rendering from compressed bitstreams. In Proceedings ACM Web3D International Symposium, pp. 37-44. ACM Press, New York, April 2007. DOI: 10.1145/1229390.1229396
20. [BHS98] J. Bittner, V. Havran, and P. Slavik. Hierarchical visibility culling with occlusion trees. In Proceedings of Computer Graphics International '98, pp. 207-219, 1998. DOI: 10.1109/CGI.1998.694268
21. [Bit02] J. Bittner. Hierarchical Techniques for Visibility Computations. Ph.D. thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, October 2002.
22. [Bro92] F. Brooks. Walkthrough project: Final technical report to national science foundation computer and information science and engineering. Technical report, University of North Carolina-Chapel Hill, Computer Science, TR92-026, 1992.
23. [Bru07] B. Bruderlin. Interviews3d - a platform for interactive handling of massive data sets. IEEE Computer Graphics and Applications, 2007. DOI: 10.1109/MCG.2007.153
24. [BSGM02] B. Baxter, A. Sud, N. Govindaraju, and D. Manocha. GigaWalk: Interactive walkthrough of complex 3D environments. Proceedings of Eurographics Workshop on Rendering, pp. 203-214, 2002.
25. [Bux02] B. Buxton. Less is more (more or less), in the invisible future: The seamless integration of technology into everyday life. McGraw-Hill, 2002.
26. [BW03] J. Bittner and P. Wonka. Visibility in computer graphics. Journal of Environment and Planning B: Planning and Design, 30(5):729-756, 2003. DOI: 10.1068/b2957
27. [BWPP04] J. Bittner, M. Wimmer, H. Piringer, and W. Purgathofer. Coherent hierarchical culling: Hardware occlusion queries made useful. Computer Graphics Forum, 23(3):615-624, 2004. DOI: 10.1111/j.1467-8659.2004.00793.x
28. [BWW01] J. Bittner, P. Wonka, and M. Wimmer. Visibility preprocessing for urban scenes using line space subdivision. In PG '01: Proceedings of the 9th Pacific Conference on Computer Graphics and Applications, p. 276, Washington, DC, IEEE Computer Society, 2001. DOI: 10.1109/PCCGA.2001.962883
29. [Cat74] E.E. Catmull. A Subdivision Algorithm for Computer Display of Curved Surfaces. Ph.D. thesis, Dept. of CS, University of Utah, December 1974.
30. [CBWR07] J.P. Charalambos, J. Bittner, M. Wimmer, and E. Romero. Optimized hlod refinement driven by hardware occlusion queries. In Advances in Visual Computing (Third International Symposium on Computer Vision - ISVC 2007), Lecture Notes in Computer Science, volume 4841, pp. 106-117. Springer, November 2007. DOI: 10.1007/978-3-540-76858-6-11
31. [CC78] E. Catmull and J. Clark. Recursively generated B-spline surfaces on arbitrary topological meshes. Computer-Aided Design, 10:350-355, September 1978. DOI: 10.1016/0010-4485(78)90110-0
32. [CCMS97] A. Ciampalini, P. Cignoni, C. Montani, and R. Scopigno. Multiresolution decimation based on global error. The Visual Computer, 13(5):228-246, June 1997. DOI: 10.1007/s003710050101
33. +07] P. Cignoni, M. Di Benedetto, F. Ganovelli, E. Gobbetti, F. Marton, and R. Scopigno. Ray-Casted BlockMaps for Large Urban Models Visualization. In Computer Graphics Forum (Proceedings of Eurographics), 2007. DOI: 10.1111/j.1467-8659.2007.01063.x
34. +03a] P. Cignoni, F. Ganovelli, E. Gobbetti, F. Marton, F. Ponchio, and R. Scopigno. BDAM - batched dynamic adaptive meshes for high performance terrain visualization. Computer Graphics Forum, 22(3):505-514, Proceedings Eurographics 2003. September 2003. DOI: 10.1111/1467-8659.00698
35. +03b] P. Cignoni, F. Ganovelli, E. Gobbetti, F. Marton, F. Ponchio, and R. Scopigno. Planet-sized batched dynamic adaptive meshes (p-bdam). In Proceedings IEEE Visualization, pp. 147-155, Seattle, WA, Computer Society Press. October 2003. DOI: 10.1109/VISUAL.2003.1250366
36. +04] P. Cignoni, F. Ganovelli, E. Gobbetti, F. Marton, F. Ponchio, and R. Scopigno. Adaptive tetrapuzzles: Efficient out-of-core construction and visualization of gigantic multiresolution polygonal models. ACM Transactions on Graphics, 23(3):796-803, August 2004. DOI: 10.1145/1015706.1015802
37. +05] P. Cignoni, F. Ganovelli, E. Gobbetti, F. Marton, F. Ponchio, and R. Scopigno. Batched multi triangulation. In Proceedings IEEE Visualization, pp. 207-214, Conference held in Minneapolis, MI, IEEE Computer Society Press. October 2005. DOI: 10.1109/VISUAL.2005.1532797
38. [Che95] S.E. Chen. Quicktime VR - an image-based approach to virtual environment navigation. In R. Cook, Ed., SIGGRAPH 95 Conference Proceedings, Annual Conference Series, Los Angeles, pp. 29-38. ACM SIGGRAPH, Addison-Wesley, August 1995. DOI: 10.1145/218380.218395
39. [CKS03] W.T. Corrêa, J.T. Klosowski, and C.T. Silva. Visibility-based prefetching for interactive out-of-core rendering. In Proceedings of PVG 2003 (6th IEEE Symposium on Parallel and Large-Data Visualization and Graphics), pp. 1-8, 2003. DOI: 10.1109/PVGS.2003.1249035
40. [Cla76] J.H. Clark. Hierarchical geometric models for visible surface algorithms. Communications of the ACM, 19(10):547-554, October 1976. DOI: 10.1145/360349.360354
41. [CM95] S. Coleman and K. McKinley. Tile size selection using cache organization and data layout. SIGPLAN Conference on Programming Language Design and Implementation, pp. 279-290, 1995. DOI: 10.1145/207110.207162
42. [CMRS03] P. Cignoni, C. Montani, C. Rocchini, and R. Scopigno. External memory management and simplification of huge meshes. In IEEE Transaction on Visualization and Computer Graphics, pp. 525-537, 2003. DOI: 10.1109/TVCG.2003.1260746
43. [COCSD03] D. Cohen-Or, Y.L. Chrysanthou, C.T. Silva, and F. Durand. A survey of visibility for walk-through applications. IEEE Transactions on Visualization and Computer Graphics, 9(3):412-431, July/September 2003. DOI: 10.1109/TVCG.2003.1207447
44. [COFHZ98] D. Cohen-Or, G. Fibich, D. Halperin, and E. Zadicario. Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes. Computer Graphics Forum, 17(3):243-254, ISSN 1067-7055. 1998. DOI: 10.1111/1467-8659.00271
45. [Coo84] R.L. Cook. Shade trees. Computer Graphics (SIGGRAPH 84 Proceedings), 18(3):223-231, July 1984. DOI: 10.1145/964965.808602
46. [COZ98] D. Cohen-Or and E. Zadicario. Visibility streaming for network-based walkthroughs. In Graphics Interface '98, pp. 1-7, June 1998.
47. [CSAD04] D. Cohen-Steiner, P. Alliez, and M. Desbrun. Variational shape approximation. ACM Transactions on Graphics, 23(3):905-914, August 2004. DOI: 10.1145/1015706.1015817
48. [CT96] S. Coorg and S. Teller. Temporally coherent conservative visibility. In Proceedings 12th Annu. ACM Symp. Comp. Geom., pp. 78-87, 1996. DOI: 10.1145/237218.237242
49. [CT97] S. Coorg and S. Teller. Real-time occlusion culling for models with large occluders. In 1997 Symposium on Interactive 3D Graphics, pp. 83-90, 1997. DOI: 10.1145/253284.253312
50. +96] J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F.P. Brooks, Jr., and W. Wright. Simplification envelopes. In H. Rushmeier, Ed., SIGGRAPH 96 Conference Proceedings, Annual Conference Series, pp. 119-128. ACM SIGGRAPH, Addison-Wesley, held in New Orleans, Louisiana, 04-09 August 1996. DOI: 10.1145/237170.237220
51. [DD02] F. Duguet and G. Drettakis. Robust epsilon visibility. In J. Hughes, Ed., Proceedings of ACMSIGGRAPH 2002. ACM Press / ACM SIGGRAPH, July 2002.
52. [DDTP00] F. Durand, G. Drettakis, J. Thollot, and C. Puech. Conservative visibility preprocessing using extended projections. In SIGGRAPH 00 Conference Proceedings, pp. 239-248, 2000. DOI: 10.1145/344779.344891
53. [Dee95] M.F. Deering. Geometry compression. In ACM SIGGRAPH, pp. 13-20, 1995. DOI: 10.1145/218380.218391
54. [DGBGP05] P. Diaz-Gutierrez, A. Bhushan, M. Gopi, and R. Pajarola. Constrained strip generation and management for efficient interactive 3d rendering. In Computer Graphics International, pp. 115-121, 2005. DOI: 10.1109/CGI.2005.1500388
55. [dL04] R. de Toledo and B. Levi. Extending the graphic pipeline with new GPU-accelerated primitives. In Proceedings 24th gOcad Meeting, Nancy, France, 2004.
56. [dLP07] R. deToledo, B. Levy, and J.-C. Paul. Iterative methods for visualization of implicit surfaces on gpu. In ISVC, International Symposium on Visual Computing, Lecture Notes in Computer Science, Lake Tahoe, Nevada/California, Springer, November 2007.
57. [DPS02] J. Diaz, J. Petit, and M. Serna. A survey of graph layout problems. ACM Computing Surveys, 34(3):313-356, 2002. DOI: 10.1145/568522.568523
58. [DS78] D. Doo and M. Sabin. Behaviour of recursive division surfaces near extraordinary points. Computer-Aided Design, 10:356-360, September 1978. DOI: 10.1016/0010-4485(78)90111-2
59. [DSSD99] X. Decoret, F. Sillion, G. Schaufier, and J. Dorsey. Multi-layered impostors for accelerated rendering. Computer Graphics Forum, 18(3):61-73, ISSN 1067-7055. September 1999. DOI: 10.1111/1467-8659.00328
60. [DSW07] A. Dietrich, A. Stephens, and I. Wald. Exploring a boeing 777: Ray tracing large-scale cad data. IEEE Computer Graphics and Applications, 2007. DOI: 10.1109/MCG.2007.147
61. [Dur99] F. Durand. 3D Visibility: Analytical Study and Applications. Ph.D. thesis, Universite Joseph Fourier, Grenoble, France, 1999.
62. +97] M. Duchaineau, M. Wolinsky, D.E. Sigeti, M.C. Miller, C. Aldrich, and M.B. Mineev-Weinstein. ROAMing Terrain: Real-time Optimally Adapting Meshes. In Proceedings IEEE Visualization, pp. 81-88, 1997. DOI: 10.1109/VISUAL.1997.663860
63. [EM99] C. Erikson and D. Manocha. GAPS: General and automatic polygon simplification. In Proceedings of ACM Symposium on Interactive 3D Graphics, 1999. DOI: 10.1145/300523.300532
64. [EMB01] C. Erikson, D. Manocha, and B. Baxter. HLODS for fast display of large static and dynamic environments. Proceedings of ACM Symposium on Interactive 3D Graphics, 2001. DOI: 10.1145/364338.364376
65. [FKST96] T.A. Funkhouser, D. Khorramabadi, C.H. Sequin, and S. Teller. The ucb system for interactive visualization of large architectural models. Presence, 5(1):13-44, 1996.
66. [FLPR99] M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cacheoblivious algorithms. In Foundations of Computer Science, pp. 285-297, 1999. DOI: 10.1109/SFFCS.1999.814600
67. [FMP98] L. De Floriani, P. Magillo, and E. Puppo. Efficient Implementation of Multi-Triangulations. In Proceedings of IEEE Visualization 1998, pp. 43-50, 1998. DOI: 10.1109/VISUAL.1998.745283
68. [FNB03] M. Franquesa-Niubo and P. Brunet. Collision prediction using mktrees. Proceedings CEIG, pp. 217-232, 2003.
69. [FTW00] P. Fishburn, P. Tetali, and P. Winkler. Optimal linear arrangement of a rectangular grid. Discrete Mathematics, 213(1):123-139, 2000. DOI: 10.1016/S0012-365X(99)00173-9
70. [GD98] J.P. Grossman and W.J. Dally. Point Sample Rendering. In Rendering Techniques 1998 (Proceedings of the Eurographics Workshop on Rendering), pp. 181-192, 1998.
71. [GGH02] X. Gu, S.J. Gortler, and H. Hoppe. Geometry Images. In ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH), pp. 335-361, 2002. DOI: 10.1145/566570.566589
72. [GGSC96] S.J. Gortler, R. Grzeszczuk, R. Szeliski, and M.F. Cohen. The lumigraph. In Proceedings of SIGGRAPH 96, Computer Graphics Proceedings, Annual Conference Series, pp. 43-54, August 1996. DOI: 10.1145/237170.237200
73. [GH97] M. Garland and P.S. Heckbert. Surface simplification using quadric error metrics. In Proceedings of SIGGRAPH 97, Computer Graphics Proceedings, Annual Conference Series, pp. 209-216, August 1997. DOI: 10.1109/VISUAL.1998.745312
74. [GH98] M. Garland and P.S. Heckbert. Simplifying surfaces with color and texture using quadric error metrics. In IEEE Visualization '98, pp. 263-270, October 1998. DOI: 10.1145/566570.566589
75. [GI99] J. Gil and A. Itai. How to pack trees. Journal of Algorithms, 32(2):108-132, 1999. DOI: 10.1006/jagm.1999.1014
76. [Gib50] J. Gibson. The perception of the visual world. Houghton Miffin, Boston, MA, 1950.
77. [GJS76] M. Garey, D. Johnson, and L. Stockmeyer. Some simplified np-complete graph problems. Theoretical Computer Science 1, pp. 237-267, 1976. DOI: 10.1016/0304-3975(76)90059-1
78. [GKM93] N. Greene, M. Kass, and G. Miller. Hierarchical Z-Buffer Visibility. In Computer Graphics (Proceedings of ACM SIGGRAPH), pp. 231-238, 1993. DOI: 10.1145/166117.166147
79. [GL96] C. Gotsman and M. Lindenbaum. On the metric properties of discrete space-filling curves. IEEE Transactions on Image Processing, 5(5):794-797, 1996. DOI: 10.1109/83.499920
80. [GM04] E. Gobbetti and F. Marton. Layered point clouds: A simple and efficient multiresolution structure for distributing and rendering gigantic point-sampled models. Computers & Graphics, 28(6):815-826, December 2004. DOI: 10.1016/j.cag.2004.08.010
81. [GM05] E. Gobbetti and F. Marton. Far Voxels - a multiresolution framework for interactive rendering of huge complex 3d models on commodity graphics platforms. ACM Transactions on Graphics, 24(3):878-885, 2005. DOI: 10.1145/1073204.1073277
82. +06] E. Gobbetti, F. Marton, P. Cignoni, M. Di Benedetto, and F. Ganovelli. CBDAM - compressed batched dynamic adaptive meshes for terrain rendering. Computer Graphics Forum, 25(3):333-342, Proceedings Eurographics, 2006. DOI: 10.1111/j.1467-8659.2006.00952.x
83. [Gol81] R. Goldstein. Defining the bounding edges of a synthavision solid model. In 18th Conference on Design Automation, pp. 457-461, 1981.
84. [GP07] M. Gross and H.-P. Pfister, Eds. Point-based Graphics. Elsevier Sciences Ltd., 2007.
85. [GSF99] C. Gotsman, O. Sudarsky, and J.A. Fayman. Optimized occlusion culling using five-dimensional subdivision. Computers & Graphics, 23(5):645-654, October 1999. DOI: 10.1016/S0097-8493(99)00088-6
86. [GSYM03] N.K. Govindaraju, A. Sud, S.-E. Yoon, and D. Manocha. Interactive visibility culling in complex environments using occlusion-switches. In 2003 ACM Symposium on Interactive 3D Graphics, pp. 103-112, April 2003. DOI: 10.1145/641480.641501
87. [GZ05] M. Garland and Y. Zhou. Quadric-based simplification in any dimension. ACM Transactions on Graphics, 24(2):209-239, April 2005. DOI: 10.1145/1061347.1061350
88. [Hav00] V. 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.
89. +93] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle. Mesh optimization. In J.T. Kajiya, Ed., Computer Graphics (SIGGRAPH '93 Proceedings), volume 27, pp. 19-26, August 1993. DOI: 10.1145/166117.166119
90. [HHS06] V. Havran, R. Herzog, and H.-. Seidel. On the fast construction of spatial data structures for ray tracing. In Proceedings of IEEE Symposium on Interactive Ray Tracing 2006, pp. 71-80, September 2006. DOI: 10.1109/RT.2006.280217
91. +97] T. Hudson, D. Manocha, J. Cohem, M. Lin, K. Hoff, and H. Zhang. Accelerated occlusion culling using shadow frusta. In Proceedings 13th Annu. ACM Sympos. Comput. Geom., pp. 1-10, 1997. DOI: 10.1145/262839.262847
92. [HMN05] D. Haumont, O. Makinen, and S. Nirenstein. A low dimensional framework for exact polygon-to-polygon occlusion queries. In O. Deussen, A. Keller, K. Bala, P. Dutré, D.W. Fellner, and S.N. Spencer, Eds., Rendering Techniques, pp. 211-222. Eurographics Association, 2005.
93. [HMS06] W. Hunt, W.R. Mark, and G. Stoll. Fast kd-tree construction with an adaptive errorbounded heuristic. In 2006 IEEE Symposium on Interactive RayTracing. IEEE, September 2006. DOI: 10.1109/RT.2006.280218
94. [Hop96] H. Hoppe. Progressive meshes. In H. Rushmeier, Ed., SIGGRAPH 96 Conference Proceedings, Annual Conference Series, pp. 99-108. ACM SIGGRAPH, Addison-Wesley, held in New Orleans, Louisiana, 04-09 August 1996. DOI: 10.1145/237170.237216
95. [Hop98] H. Hoppe. Smooth view-dependent level-of-detail control and its applications to terrain rendering. In IEEE Visualization '98 Conf., pp. 35-42, 1998. DOI: 10.1109/VISUAL.1998.745282
96. [Hop99a] H.Hoppe. Optimization of mesh locality for transparent vertex caching. ACMSIGGRAPH, pp. 269-276, 1999. DOI: 10.1145/311535.311565
97. [Hop99b] H.H. Hoppe. New quadric metric for simplifying meshes with appearance attributes. In IEEE Visualization '99, pp. 59-66, October 1999. DOI: 10.1109/VISUAL.1999.809869
98. [HPB05] M. Heyer, S. Pfützer, and B. Brüderlin. Visualization Server for Very Large Virtual Reality Scenes. In 4. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2005.
99. [IG03] M. Isenburg and S. Gumhold. Out-of-core compression for gigantic polygon meshes. In ACMTrans. on Graphics (Proceedings of ACMSIGGRAPH), volume 22, pp. 935-942, 2003. DOI: 10.1145/882262.882366
100. [IL05] M. Isenburg and P. Lindstrom. Streaming meshes. IEEE Visualization, pp. 231-238, 2005. DOI: 10.1109/VISUAL.2005.1532800
101. [ILGS03a] M. Isenburg, P. Lindstrom, S. Gumhold, and J. Snoeyink. Large mesh simplification using processing sequences. IEEE Visualization, pp. 465-472, 2003. DOI: 10.1109/VISUAL.2003.1250408
102. [ILGS03b] M. Isenburg, P. Lindstrom, S. Gumhold, and J. Snoeyink. Large Mesh Simplification using Processing Sequences. In Proceedings of IEEE Visualization 2003, pp. 465-472, 2003.
103. [ISGM02] W.V. Baxter III, A. Sud, N.K. Govindaraju, and D. Manocha. Gigawalk: Interactive walk-through of complex environments. In Rendering Techniques 2002: 13th Eurographics Workshop on Rendering, pp. 203-214, June 2002.
104. [JM92] M. Juvan and B. Mohar. Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics, 36(2):153-168, 1992. DOI: 10.1016/0166-218X(92)90229-4
105. [JW02] S. Jeschke and M. Wimmer. Textured depth meshes for realtime rendering of arbitrary scenes. In S. Gibson and P. Debevec, Eds., Proceedings of the 13th Eurographics Workshop on Rendering (RENDERING TECHNIQUES-02), pp. 181-190, Aire-la-Ville, Switzerland, Eurographics Association, June 26-28 2002.
106. [JWS02] S. Jeschke, M. Wimmer, and H. Schumann. Layered environment-map impostors for arbitrary scenes. In Graphics Interface, pp. 1-8, 2002.
107. [Kas04] D. Kasik. Strategies for consistent image partitioning. IEEE Multimedia, 11(1):32-41, 2004. DOI: 10.1109/MMUL.2004.1261104
108. [KBG02] Z. Karni, A. Bogomjakov, and C. Gotsman. Efficient compression and rendering of multi-resolution meshes. In IEEE Visualization, pp. 347-54, 2002. DOI: 10.1109/VISUAL.2002.1183794
109. [KCCO00] V. Koltun, Y. Chrysanthou, andD. Cohen-Or. Virtual occluders: An efficient intermediate pvs representation. In Rendering Techniques 2000: 11th Eurographics Workshop on Rendering, pp. 59-70, June 2000.
110. [KCCO01] V. Koltun, Y. Chrysanthou, and D. Cohen-Or. Hardware-accelerated from-region visibility using a dual ray space. In Proceedings of the 12th Eurographics Workshop on Rendering Techniques, pp. 205-216, London, UK, Springer-Verlag, 2001.
111. [KK98] G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, pp. 96-129, 1998. DOI: 10.1006/jpdc.1997.1404
112. [KKF99] D. Kasik, C. Kimball, and J. Felt K. Frazier. A flexible approach to alliances of complex applications. International Conference on Software Engineering, 1999. DOI: 10.1109/ICSE.1999.840992
113. [KKM07] A. Krishnamurthy, R. Khardekar, and S. McMains. Direct evaluation of nurbs curves and surfaces on the gpu. In SPM'07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, pp. 329-334, New York, NY, ACM, 2007. DOI: 10.1145/1236246.1236293
114. [KLS96] R. Klein, G. Liebich, and W. Straer. Mesh reduction with error control. In IEEE Visualization '96. IEEE, ISBN 0-89791-864-9, October 1996. DOI: 10.1109/VISUAL.1996.568124
115. [KMGL99] S. Kumar, D. Manocha, W. Garret, and M. Lin. Hierarchical back-face computation. Computer and Graphics, 25(5):681-692, 1999. DOI: 10.1016/S0097-8493(99)00091-6
116. [KS00] J.T. Klosowski and C.T. Silva. The Prioritized-Layered Projection Algorithm for Visible Set Estimation. In IEEE Transaction on Visualization and Computer Graphics, pp. 108-123, 2000. DOI: 10.1109/2945.856993
117. [KS01] J.T. Klosowski and C.T. Silva. Efficient conservative visibility culling using the prioritized-layered projection algorithm. IEEE Transactions on Visualization and Computer Graphics, 7(4):365-379, 2001. DOI: 10.1109/2945.965350
118. [LB06] C. Loop and J. Blinn. Real-time gpu rendering of piece wise algebraic surfaces. ACM Transactions on Graphics, 25(3):664-670, July 2006. DOI: 10.1145/1141911.1141939
119. [LCCO06] A. Lerner, Y. Chrysanthou, and D. Cohen-Or. Efficient cells-and-portals partitioning: Research articles. Comput. Animat. Virtual Worlds, 17(1):21-40,2006.DOI: 10.1002/cav.70
120. [LG95] D.P. Luebke and C. Georges. Portals and mirrors: Simple, fast evaluation of potentially visible sets. In Proceedings Symp. Interactive 3-D Graphics, pp. 105-106, 1995.
121. [LH96] M. Levoy and P. Hanrahan. Light field rendering. In SIGGRAPH96 Conference Proceedings, pp. 31-42, 1996. DOI: 10.1145/237170.237199
122. [Lin00] P. Lindstrom. Out-of-core simplification of large polygonal models. In Proceedings of ACM SIGGRAPH 2000, Computer Graphics Proceedings, Annual Conference Series, pp. 259-262, July 2000. DOI: 10.1145/344779.344912
123. [Lin03] P. Lindstrom. Out-of-core construction and visualization of multiresolution surfaces. In ACM 2003 Symposium on Interactive 3D Graphics, pp. 93-102, 2003. DOI: 10.1145/641480.641500
124. [Lip80] A. Lippman. Movie-maps: An application of the optical videodisc to computer graphics. Computer Graphics (SIGGRAPH '80 Proceedings), 14(3):32-42, July 1980. DOI: 10.1145/965105.807465
125. [LP01] P. Lindstrom and V. Pascucci. Visualization of large terrains made easy. IEEE Visualization, pp. 363-370, 2001. DOI: 10.1109/VISUAL.2001. 964533
126. +02] D. Luebke, M. Reddy, J. Cohen, A. Varshney, B. Watson, and R. Huebner. Level of Detail for 3D Graphics: Applications and Theory. Morgan Kaufmann, 2002.
127. [LSCO03] T. Leyvand, O. Sorkine, and D. Cohen-Or. Ray space factorization for from-region visibility. ACM Transactions on Graphics, 22(3):595-604, July 2003. DOI: 10.1145/882262.882313
128. [Lue01] D.P. Luebke. A Developer's Survey of Polygonal Simplification Algorithms. IEEE Computer Graphics and Applications, 21(3):24-35, 2001. DOI: 10.1109/38.920624
129. [LV03] P. Lyman and H. Varian. How much information? http://www2.sims. berkeley.edu/research/projects/how-much-info/, 2003.
130. [LW85] M. Levoy and T. Whitted. The Use of Points as a Display Primitive.Technical Report TR 85-022, University of North Carolina at Chapel Hill, 1985.
131. [LYTM06] C. Lauterbach, S.-E. Yoon, D. Tuft, and D. Manocha. Rt-deform: Interactive ray tracing of dynamic scenes using bvhs. In Proceedings of IEEE Symposium on Interactive Ray Tracing 2006, September 2006. DOI: 10.1109/RT.2006.280213
132. [MAM05] F. Mora, L. Aveneau, and M. Mériaux. Coherent and exact polygon-to-polygon visibility. In Proceedings WSCG, pp. 87-94, 2005.
133. [MB95] L. McMillan and G. Bishop. Plenoptic Modeling: An Image-Based Rendering System. In ACMComputer Graphics (Proceedings of ACM SIGGRAPH), pp. 39-46, 1995.
134. [MBW06] O. Mattausch, J. Bittner, and M. Wimmer. Adaptive visibility-driven view cell construction. In Rendering Techniques 2006: 17th Eurographics Workshop on Rendering, pp. 195-206, June 2006.
135. [MBWW07] O. Mattausch, J. Bittner, P. Wonka, and M. Wimmer. Optimized subdivisions for preprocessed visibility. In Graphics Interface 2007, pp. 335-342, May 2007. DOI: 10.1145/1268517.1268571
136. [Moo65] G. Moore. Cramming more components onto integrated circuits. Electronics Magazine, 38(8):114-117, 1965. DOI: 10.1109/JPROC.1998.658762
137. [Moo91] A. Moore. A Tutorial on kd-trees. Ph.D. thesis, University of Cambridge, 1991.
138. [MP80] D. Muradyan and T. Piliposyan. Minimal numberings of vertices of a rectangular lattice. In Akad. Nauk. Arimjan, pp. 21-27, 1980.
139. [NB04] S. Nirenstein and E. Blake. Hardware accelerated visibility preprocessing using adaptive sampling. In Rendering Techniques 2004: 15th Eurographics Workshop on Rendering, pp. 207-216, June 2004.
140. [NBG02] S. Nirenstein, E. Blake, and J. Gain. Exact from-region visibility culling. In EGRW '02: Proceedings of the 13th Eurographics workshop on Rendering, pp. 191-202, Aire-la-Ville, Switzerland, Switzerland, Eurographics Association, 2002.
141. [ND05] M.A. Sabin N. Dodgson, M.S. Floater, Eds. Advances in Multiresolution for Geometric Modelling. Springer, 2005.
142. [NFLYCO99] B. Nadler, G. Fibich, S. Lev-Yehudi, and D. Cohen-Or. A qualitative and quantitative visibility analysis in urban scenes. Computers & Graphics, 23(5):655-666, October 1999. DOI: 10.1016/S0097-8493(99) 00089-8
143. [NRS97] R. Niedermeier, K. Reinhardt, and P. Sanders. Towards optimal locality in mesh-indexings. In Fundamentals of Computation Theory, pp. 364-375, 1997. DOI: 10.1007/BFb0036198
144. [NRS02] R. Niedermeier, K. Reinhardt, and P. Sanders. Towards optimal locality in mesh-indexings. Discrete Applied Mathematics, 117(1):211-237, 2002. DOI: 10.1016/S0166-218X(00)00326-7
145. [OBM00] M.M. Oliveira, G. Bishop, and D. McAllister. Relief Texture Mapping. In ACM Computer Graphics (Proceedings of ACM SIGGRAPH), pp. 359-368, 2000. DOI: 10.1145/344779.344947
146. [oM95] National Library of Medicine. The visible human project. NL Medicine, 1995.
147. +97] D. Patterson, T. Anderson, N. Cardwell, R. Fromm, K. Keaton, C. Kazyrakis, R. Thomas, and K. Yellick. A case for intelligent ram. IEEE Micro., 34-44, 1997. DOI: 10.1109/40.592312
148. [PCM07] Flicker fusion rate. PCMag.Com Encyclopedia Terms, 2007.
149. [PF01] V. Pascucci and R.J. Frank. Global static indexing for real-time exploration of very large regular grids. In Supercomputing, 363-370, 2001. DOI: 10.1145/582034.582036
150. [PG07] R. Pajarola and E. Gobbetti. Survey on semi-regular multiresolution models for interactive terrain rendering. The Visual Computer, 23(8):583-605, 2007. DOI: 10.1007/s00371-007-0163-2
151. [PGSS06] S. Popov, J. Günther, H.-P. Seidel,and P. Slusallek. Experiences with streaming construction of SAH KD-trees. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, pp. 89-94, September 2006. DOI: 10.1109/RT.2006.280219
152. [POC05] F. Policarpo, M.M. Oliveira, and J.L.D. Comba. Real-time relief mapping on arbitrary polygonal surfaces. ACM Trans. Graph, 24(3):935, 2005.DOI: 10.1145/1073204.1073292
153. [Pri00] C. Prince. Progressive meshes for large models of arbitrary topology. Master's thesis, Department of Computer Science and Engineering, University of Washington, Seattle, August 2000.
154. [RB93] J. Rossignac and P. Borrel. Multi-resolution 3D approximation for rendering complex scenes. In Second Conference on Geometric Modelling in Computer Graphics, pp. 453-465, Genova, Italy, June 1993.
155. [RL00a] S. Rusinkiewicz and M. Levoy. Qsplat: A multiresolution point rendering system for large meshes. Proceedings of ACM SIGGRAPH, pp. 343-352, 2000.
156. [RL00b] S. Rusinkiewicz and M. Levoy. Qsplat: A multiresolution point rendering system for large meshes. In Proceedings of ACM SIGGRAPH 2000, Computer Graphics Proceedings, Annual Conference Series, pp. 343-352, July 2000.
157. [RL00c] S. Rusinkiewicz and M. Levoy. QSplat: A Multiresolution Point Rendering System for Large Meshes. In Computer Graphics (Proceedings of ACM SIGGRAPH), pp. 343-352, 2000.
158. [RR96] R. Ronfard and J. Rossignac. Full-range approximation of triangulated polyhedra. Computer Graphics Forum (Eurographics'96 Proceedings), 15(3):67-76, 1996. DOI: 10.1111/1467-8659.1530067
159. [RSH05] A. Reshetov, A. Soupikov, and J. Hurley. Multi-Level Ray Tracing Algorithm. In ACM Transaction of Graphics (Proceedings of ACM SIGGRAPH), pp. 1176-1185, 2005. DOI: 10.1145/1073204.1073329
160. [RW94] C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 1994.
161. [Sag94] H. Sagan. Space-Filling Curves. Springer-Verlag, 1994.
162. [Sam06] H. Samet, Ed. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, 2006.
163. [SC97] M. Slater and Y. Chrysanthou. View volume culling using a probabilistic caching scheme. In Proceedings of the ACM Symposium on Virtual Reality Software and Technology, pp. 71-78, 1997. DOI: 10.1145/261135.261150
164. +02] C. Silva, Y.-J. Chiang, W. Correa, J. El-Sana, and P. Lindstrom. Out-of-core algorithms for scientific visualization and computer graphics. In IEEE Visualization Course Notes, 2002.
165. [SCD02] S. Sen, S. Chatterjee, and N. Dumir. Towards a theory of cache-efficient algorithms. Journal of the ACM, 49:828-858, 2002. DOI: 10.1145/602220.602225
166. [SD01] M. Stamminger and G. Drettakis. Interactive Sampling and Rendering for Complex and Procedural Geometry. In Proceedings of the Eurographics Workshop on Rendering Techniques, pp. 151-162, 2001.
167. [SDB97] F. Sillion, G. Drettakis, and B. Bodelet. Efficient Impostor Manipulation for Real-Time Visualization of Urban Scenery. In Computer Graphics Forum (Proceedings of Eurographics), pp. 207-218, 1997. DOI: 10.1111/1467-8659.00158
168. [SG01] E. Shaffer and M. Garland. Efficient adaptive simplification of massive meshes. In IEEE Visualization 2001, pp. 127-134, October 2001. DOI: 10.1109/VISUAL.2001.964503
169. [SGHS98] J. Shade, S. Gortler, L.-W. He, and R. Szeliski. Layered Depth Images. In Computer Graphics (Proceedings of ACM SIGGRAPH), pp. 231-242, 1998. DOI: 10.1145/280814.280882
170. [SGwHS98] J. Shade, S.J. Gortler, L.-W. He, and R. Szeliski. Layered depth images. In Proceedings of SIGGRAPH 98, Computer Graphics Proceedings, Annual Conference Series, pp. 231-242, July 1998.
171. [SJDS00] G. Schaufler, J. Dorsey, X. Decoret, and F.X. Sillion. Conservative volumetric visibility with occluder fusion. In SIGGRAPH 00 Conference Proceedings, pp. 229-238, 2000. DOI: 10.1145/344779.344886
172. +07] M. Shevtsov, A. Soupikov, and A. Kapustin. Highly parallel fast kd-tree construction for interactive ray tracing of dynamic scenes. Computer Graphics Forum, 26(3):395-404, September 2007. DOI: 10.1111/j.1467-8659.2007.01062.x
173. [Ste97] A.J. Stewart. Hierarchical visibility in terrains. In Eurographics Rendering Workshop 1997, pp. 217-228, June 1997.
174. [Ste07] J. Stevens. Concepts and concerns related to the visualization of complex automotive data. IEEE Computer Graphics and Applications, 2007. DOI: 10.1109/MCG.2007.161
175. [Str74] W. Strasser. Schnelle Kurven- und Flaechendarstellung auf graphischen Sichtgeraeten. Ph.D. thesis, TU Berlin, 1974. DOI: 10.1109/MCG.2007.161
176. [Stu99] W. Stuerzlinger. Imaging all visible surfaces. In Graphics Interface '99, pp. 115-122, June 1999.
177. [Sut63] I.E. Sutherland. Sketchpad: A man-machine graphical communication system. SJCC, 1963.
178. [SWBG06] C. Sigg, T. Weyrich, M. Botsch, and M. Gross. Gpu-based ray-casting of quadratic surfaces. In Symposium on Point - Based Graphics 2006, pp. 59-66, July 2006.
179. [SWS07] K. Sun, G. Watson, and C. Seeling. Shader algorithm for the interactive, stereoscopic visualization of crash worthiness simulations. IEEE Computer Graphics and Applications, 2007.
180. [SZL92] W.J. Schroeder, J.A. Zarge, and W.E. Lorensen. Decimation of Triangle Meshes. In ACM Computer Graphics (Proceedings of ACM SIGGRAPH), pp. 65-70, 1992. DOI: 10.1145/142920.134010
181. [TC05] J. Thomas and K. Cook. Illuminating the path: The research and development agenda for visual analytics. IEEE Press, 2005.
182. [TCM06] M. Tarini, P. Cignoni, and C. Montani. Ambient occlusion and edge cueing for enhancing real time molecular visualization. IEEE Transactions on Visualization and Computer Graphics, 12(5):1237-1244, September/October 2006. DOI: 10.1109/TVCG.2006.115
183. [Tel92] S.J. Teller. Computing the antipenumbra of an area light source. In Computer Graphics (Proceedings of SIGGRAPH 92), pp. 139-148, July 1992. DOI: 10.1145/142920.134029
184. [TS91] S.J. Teller and C.H. Sequin. Visibility preprocessing for interactive walk-throughs. Computer Graphics (SIGGRAPH 91 Proceedings), 25(4):61-69, July 1991. DOI: 10.1145/127719.122725
185. [VdMG91] L. Velho and J. de Miranda Gomes. Digital halftoning with space filling curves. In ACM SIGGRAPH, pp. 81-90, 1991. DOI: 10.1145/127719.122727
186. [vdPS99] M. van de Panne and J. Stewart. Efficient compression techniques for precomputed visibility. In Eurographics Rendering Workshop 1999, June 1999.
187. [vEB77] P. van E. Boas. Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett., 1977. DOI: 10.1016/0020-0190(77)90031-X
188. [Vit01] J. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, pp. 209-271, 2001. DOI: 10.1145/384192.384193
189. +97] M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D.R. Schikore. Contour trees and small seed sets for isosurface traversal. In Symp. on Computational Geometry, 1997. DOI: 10.1145/262839.269238
190. [Wal04] I. Wald. Realtime Ray Tracing and Interactive Global Illumination. Ph.D. thesis, Computer Graphics Group, Saarland University, 2004.
191. [Wal07] I. Wald. On fast construction of SAH-based bounding volume hierarchies. In Proceedings of the 2007 Eurographics/IEEE Symposium on Interactive Ray Tracing, 2007. DOI: 10.1109/RT.2007.4342588
192. [WBP98] Y. Wang, H. Bao, and Q. Peng. Accelerated walkthroughs of virtual environments based on visibility preprocessing and simplification. Computer Graphics Forum, 17(3), 1998. DOI: 10.1111/1467-8659.00266
193. [WBS07] I. Wald, S. Boulos, and P. Shirley. Ray tracing deformable scenes using dynamic bounding volume hierarchies. ACM Transactions on Graphics, 26(1):6.1-6.10, 2007. DOI: 10.1145/1276377.1276490
194. [WDS04] I. Wald, A. Dietrich, and P. Slusallek. An Interactive Out-of-Core Rendering Framework for Visualizing Massively Complex Models. In Proceedings of the Eurographics Symposium on Rendering, 2004. DOI: 10.1145/1198555.1198756
195. +07] T. Weyrich, C. Flaig, S. Heinzle, S. Mall, T. Aila, K. Rohrer, D. Fasnacht, N. Felber, S. Oetiker, H. Kaeslin, M. Botsch, and M. Gross. A Hardware Architecture for Surface Splatting. In ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH), p. 90, 2007. DOI: 10.1145/1276377.1276490
196. +01] M. Wand, M. Fischer, I. Peter, F. Meyer, and W. Straßer. The Randomized z-Buffer Algorithm: Interactive Rendering of HighlyComplex Scenes. In ComputerGraphics (Proceedings of ACM SIGGRAPH), pp. 361-370, 2001.
197. [WH06] I. Wald and V. Havran. On building fast kd-trees for ray tracing, and on doing that in o(n log n). In Proceedings of IEEE Symposium on Interactive RayTracing 2006, pp. 61-69, 2006. DOI: 10.1109/RT.2006.280216
198. [Wie02] J.-M. Wierum. Logarithmic path-length in space-filling curves. In 14th Canadian Conference on Computational Geometry, pp. 22-26, 2002.
199. [Wik07] Flicker fusion threshold article. Wikipedia, 2007.
200. [WK03] J. Wu and L. Kobbelt. A stream algorithm for the decimation of massive meshes. In Proceedings Graphics Interface, pp. 185-192, 2003.
201. [WK06] C. Wächter and A. Keller. Instant ray tracing: The bounding interval hierarchy. In Proceedings of the Eurographics Symposium on Rendering, pp. 139-149, 2006.
202. [WLML99] A. Wilson, E. Larsen, D. Manocha, and M.C. Lin. Partitioning and handling massive models for interactive collision detection. Computer Graphics Forum (Proceedings of Eurographics), 18(3):319-329, 1999. DOI: 10.1111/1467-8659.00352
203. [WM03] A. Wilson and D. Manocha. Simplifying Complex Environments Using Incremental Textured Depth Meshes. In ACMTransactions on Graphics (Proceedings of ACM SIGGRPAH), pp. 678-688, 2003. DOI: 10.1145/882262.882325
204. [WMS06] S. Woop, G. Marmitt, and P. Slusallek. B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes. In Proceedings of Graphics Hardware, 2006.
205. +03] I. Wald, T. J. Purcell, J. Schmittler, C. Benthin, and P. Slusallek. Realtime Ray Tracing and its use for Interactive Global Illumination. In Eurographics 2003 State of the Art Reports, 2003.
206. [WSBW01] I. Wald, P. Slusallek, C. Benthin, and M. Wagner. Interactive rendering with coherent ray tracing. Computer Graphics Forum, 20(3):153-164, 2001. DOI: 10.1111/1467-8659.00508
207. [WSS05] S. Woop, J. Schmittler, and P. Slusallek. RPU: A Programmable Ray Processing Unit for Realtime Ray Tracing. In ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH), pp. 434-444, 2005. DOI: 10.1145/1073204. 1073211
208. +04] X. Wang, X. Tong, S. Lin, S. Hu, B. Guo, and H.-Y. Shum. Generalized displacement maps. In D. Fellner and S. Spencer, Eds., Proceedings of the 2004 Eurographics Symposium on Rendering, pp. 227-234. Eurographics Association, June 2004.
209. [WWS00] P. Wonka, M. Wimmer, and D. Schmalstieg. Visibility preprocessing with occluder fusion for urban walkthroughs. In 11th Eurographics Workshop on Rendering, pp. 71-82, 2000.
210. [WWS01a] M. Wimmer, P. Wonka, and F. Sillion. Point-based impostors for real-time visualization, May 29, 2001.
211. [WWS01b] P. Wonka, M. Wimmer, and F.X. Sillion. Instant visibility. Computer Graphics Forum, 20(3):411-421, 2001. DOI: 10.1111/1467-8659. 00534
212. +03] L. Wang, X. Wang, X. Tong, S. Lin, S.-M. Hu, B. Guo, and H.-Y. Shum. View-Dependent Displacement Mapping. In ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH), pp. 334-339, 2003. DOI: 10.1145/882262.882272
213. +06] P. Wonka, M. Wimmer, K. Zhou, S. Maierhofer, G. Hesina, and A. Reshetov. Guided visibility sampling. ACM Transactions on Graphics, 25(3):494-502, July 2006. DOI: 10.1145/1141911.1141914
214. [YCM07] S. Yoon, S. Curtis, and D. Manocha. Ray tracing dynamic scenes using selective restructuring. Proceedings of Eurographics Symposium on Rendering, 2007.
215. [YL06] S.-E. Yoon and P. Lindstrom. Mesh layouts for block-based caches. IEEE Transactions on Visualization and Computer Graphics (Proceedings Visualization), 12(5), 2006. DOI: 10.1109/TVCG.2006.162
216. [YLM06] S.-E. Yoon, C. Lauterbach, and D. Manocha. R-LODs: Fast LOD-Based Ray Tracing of Massive Models. The Visual Computer, 22(9-11):772-784, 2006. DOI: 10.1007/s00371-006-0062-y
217. [YLPM05] S.-E. Yoon, P. Lindstrom, V. Pascucci, and D. Manocha. Cache-Oblivious Mesh Layouts. Proceedings of ACM SIGGRAPH, 2005. DOI: 10.1145/1186822.1073278
218. [YM06] S.-E. Yoon and D. Manocha. Cache-efficient layouts of bounding volume hierarchies. Computer Graphics Forum (Eurographics), 25:507-516, 2006. DOI: 10.1111/j.1467-8659.2006.00970.x
219. [Yoo05] S.-E. Yoon. Interactive Visualization and Collision Detection using Dynamic Simplification and Cache-Coherent Layouts. Ph.D. thesis, University of North Carolina at Chapel Hill, 2005.
220. [YSGM04] S.-E. Yoon, B. Salomon, R. Gayle, and D. Manocha. Quick-VDR: Interactive View-dependent Rendering of Massive Models. IEEE Visualization, pp. 131-138, 2004.
221. [YSGM05] S.-E. Yoon, B. Salomon, R. Gayle, and D. Manocha. Quick-VDR: Out-of-Core View-Dependent Rendering of Gigantic Models. IEEE Transactions on Visualization and Computer Graphics, pp. 369-382, 2005. DOI: 10.1109/TVCG.2005.64
222. [YSLM04] S. Yoon, B. Salomon, M. C. Lin, and D. Manocha. Fast collision detection between massive models using dynamic simplification. Eurographics Symposium on Geometry Processing, pp. 136-146,2004. DOI: 10.1145/1057432.1057450
223. [ZMHH97] H. Zhang, D. Manocha, T. Hudson, and K. Hoff. Visibility culling using hierarchical occlusion maps. Proceedings of ACM SIGGRAPH, 1997. DOI: 10.1145/258734.258781
224. [ZT02] E. Zhang and G. Turk. Visibility-guided simplification. In Proceedings IEEE Visualization, pp. 267-274, 2002. DOI: 10.1109/VISUAL.2002.1183784