Massive model visualization techniques: course notes

Interactive display and visualization of large geometric and textured models is becoming a fundamental capability. There are numerous application areas, including games, movies, CAD, virtual prototyping, and scientific visualization. One of observations about geometric models used in interactive applications is that their model complexity continues to increase because of fundamental advances in 3D modeling, simulation, and data capture technologies. As computing power increases, users take advantage of the algorithmic advances and generate even more complex models and datasets. Therefore, there are many cases where we are required to visualize massive models that consist of hundreds of millions of triangles and, even, billions of triangles. However, interactive visualization and handling of such massive models still remains a challenge in computer graphics and visualization. In this monograph we discuss various techniques that enable interactive visualization of massive models. These techniques include visibility computation, simplification, levels-of-detail, and cache-coherent data management. We believe that the combinations of these techniques can make it possible to interactively visualize massive models in commodity hardware.

[1]  D. Manocha,et al.  Cache-oblivious mesh layouts , 2005, ACM Trans. Graph..

[2]  Marc Levoy,et al.  The Use of Points as a Display Primitive , 2000 .

[3]  Sandeep Sen,et al.  Towards a theory of cache-efficient algorithms , 2000, SODA '00.

[4]  Michael Wimmer,et al.  Optimized subdivisions for preprocessed visibility , 2007, GI '07.

[5]  Manuel Menezes de Oliveira Neto,et al.  Real-time relief mapping on arbitrary polygonal surfaces , 2005, I3D '05.

[6]  Seth J. Teller,et al.  Real-time occlusion culling for models with large occluders , 1997, SI3D.

[7]  Lilian Aveneau,et al.  Coherent and Exact Polygon-to-Polygon Visibility , 2005, WSCG.

[8]  George Drettakis,et al.  Efficient Impostor Manipulation for Real‐Time Visualization of Urban Scenery , 1997, Comput. Graph. Forum.

[9]  François X. Sillion,et al.  Multi‐layered impostors for accelerated rendering , 1999, Comput. Graph. Forum.

[10]  Dinesh Manocha,et al.  Hierarchical Back-Face Computation , 1996, Rendering Techniques.

[11]  Michael Garland,et al.  Efficient adaptive simplification of massive meshes , 2001, Proceedings Visualization, 2001. VIS '01..

[12]  Enrico Gobbetti,et al.  High-quality networked terrain rendering from compressed bitstreams , 2007, Web3D '07.

[13]  I. Wald,et al.  On fast Construction of SAH-based Bounding Volume Hierarchies , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

[14]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.

[15]  Dinesh Manocha,et al.  Cache-oblivious mesh layouts , 2005, ACM Trans. Graph..

[16]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[17]  Paolo Cignoni,et al.  External Memory Management and Simplification of Huge Meshes , 2003, IEEE Trans. Vis. Comput. Graph..

[18]  Mark A. Duchaineau,et al.  ROAMing terrain: Real-time Optimally Adapting Meshes , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[19]  Paolo Cignoni,et al.  Ambient Occlusion and Edge Cueing for Enhancing Real Time Molecular Visualization , 2006, IEEE Transactions on Visualization and Computer Graphics.

[20]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

[21]  Charles E. Leiserson,et al.  Cache-Oblivious Algorithms , 2003, CIAC.

[22]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[23]  David P. Luebke,et al.  Portals and mirrors: simple, fast evaluation of potentially visible sets , 1995, I3D '95.

[24]  Daniel Cohen-Or,et al.  Hardware-Accelerated from-Region Visibility Using a Dual Ray Space , 2001, Rendering Techniques.

[25]  Kellogg S. Booth,et al.  Report from the chair , 1986 .

[26]  Edwin Earl Catmull,et al.  A subdivision algorithm for computer display of curved surfaces. , 1974 .

[27]  H.-P. Seidel,et al.  On the Fast Construction of Spatial Hierarchies for Ray Tracing , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[28]  Alon Itai,et al.  How to Pack Trees , 1999, J. Algorithms.

[29]  Valerio Pascucci,et al.  Visualization of large terrains made easy , 2001, Proceedings Visualization, 2001. VIS '01..

[30]  Dinesh Manocha,et al.  Partitioning and Handling Massive Models for Interactive Collision Detection , 1999, Comput. Graph. Forum.

[31]  Philipp Slusallek,et al.  Realtime Ray Tracing and its use for Interactive Global Illumination , 2003, Eurographics.

[32]  Joëlle Thollot,et al.  Conservative visibility preprocessing using extended projections , 2000, SIGGRAPH.

[33]  Daniel Cohen-Or,et al.  Virtual Occluders: An Efficient Intermediate PVS Representation , 2000, Rendering Techniques.

[34]  Arthur Appel,et al.  Some techniques for shading machine renderings of solids , 1968, AFIPS Spring Joint Computing Conference.

[35]  Hugues Hoppe.  Smooth view-dependent level-of-detail control and its application to terrain rendering , 1998 .

[36]  Reinhard Klein,et al.  Mesh reduction with error control , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[37]  Daniel G. Aliaga,et al.  Architectural walkthroughs using portal textures , 1997 .

[38]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[39]  Peter Lindstrom,et al.  Out-of-core construction and visualization of multiresolution surfaces , 2003, I3D '03.

[40]  Enrico Gobbetti,et al.  Layered Point Clouds , 2004, PBG.

[41]  Shaun Nirenstein,et al.  A low dimensional framework for exact polygon-to-polygon occlusion queries , 2005, EGSR '05.

[42]  Jarek Rossignac,et al.  Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[43]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[44]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[45]  Manuel Menezes de Oliveira Neto,et al.  Relief texture mapping , 2000, SIGGRAPH.

[46]  Philipp Slusallek,et al.  An interactive out-of-core rendering framework for visualizing massively complex models , 2004, Rendering Techniques.

[47]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[48]  Craig Gotsman,et al.  Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes , 2002, Comput. Graph. Forum.

[49]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[50]  Paolo Cignoni,et al.  Multiresolution decimation based on global error , 1996, The Visual Computer.

[51]  Cláudio T. Silva,et al.  Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm , 2001, IEEE Trans. Vis. Comput. Graph..

[52]  Rolf Niedermeier,et al.  Towards optimal locality in mesh-indexings , 1997, Discret. Appl. Math..

[53]  Martin Isenburg,et al.  Large mesh simplification using processing sequences , 2003, IEEE Visualization, 2003. VIS 2003..

[54]  Wolfgang Stuerzlinger,et al.  Imaging all Visible Surfaces , 1999, Graphics Interface.

[55]  Peter Lindstrom,et al.  Mesh Layouts for Block-Based Caches , 2006, IEEE Transactions on Visualization and Computer Graphics.

[56]  Cláudio T. Silva,et al.  Visibility-based prefetching for interactive out-of-core rendering , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..

[57]  Michael Wimmer,et al.  Eurographics Workshop on Rendering (2002) Textured Depth Meshes for Real-time Rendering of Arbitrary Scenes , 2022 .

[58]  Marc Alexa,et al.  Point set surfaces , 2001, Proceedings Visualization, 2001. VIS '01..

[59]  Michael Wimmer,et al.  Point-Based Impostors for Real-Time Visualization , 2001, Rendering Techniques.

[60]  Shenchang Eric Chen,et al.  QuickTime VR: an image-based approach to virtual environment navigation , 1995, SIGGRAPH.

[61]  Paolo Cignoni,et al.  Adaptive TetraPuzzles: Ecient Out-of-Core Construction and Visualization of Gigantic Multiresolution Polygonal Models , 2004, SIGGRAPH 2004.

[62]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

[63]  Dinesh Manocha,et al.  Quick-VDR: interactive view-dependent rendering of massive models , 2004, IEEE Visualization 2004.

[64]  Xavier Décoret,et al.  Rendering geometry with relief textures , 2006, Graphics Interface.

[65]  Robert C. Goldstein.  Defining the Bounding Edges of a SynthaVision Solid Model , 1981, 18th Design Automation Conference.

[66]  Michael Wimmer,et al.  Guided visibility sampling , 2006, SIGGRAPH 2006.

[67]  Michael Wimmer,et al.  Adaptive visibility-driven view cell construction , 2006, EGSR '06.

[68]  William V. Baxter,et al.  GigaWalk: Interactive Walkthrough of Complex Environments , 2002, Rendering Techniques.

[69]  Dinesh Manocha,et al.  Visibility culling using hierarchical occlusion maps , 1997, SIGGRAPH.

[70]  ChrisPrince Departmentof ComputerScienceandEngineering.  Progressive Meshes for Large Models of Arbitrary Topology , 2000 .

[71]  Dinesh Manocha,et al.  Accelerated occlusion culling using shadow frusta , 1997, SCG '97.

[72]  Philipp Slusallek,et al.  B-KD trees for hardware accelerated ray tracing of dynamic scenes , 2006, GH '06.

[73]  A. James Stewart,et al.  Effective Compression Techniques for Precomputed Visibility , 1999, Rendering Techniques.

[74]  Maxim Shevtsov,et al.  Highly Parallel Fast KD‐tree Construction for Interactive Ray Tracing of Dynamic Scenes , 2007, Comput. Graph. Forum.

[75]  E. Gobbetti,et al.  Far voxels: a multiresolution framework for interactive rendering of huge complex 3D models on commodity graphics platforms , 2005, ACM Trans. Graph..

[76]  Vlastimil Havran,et al.  Hierarchical visibility culling with occlusion trees , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[77]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[78]  Daniel Cohen-Or,et al.  Visiblity Streaming for Network-based Walkthroughs , 1998, Graphics Interface.

[79]  Martin Isenburg,et al.  Out-of-core compression for gigantic polygon meshes , 2003, ACM Trans. Graph..

[80]  Markus Gross,et al.  Point-Based Graphics , 2007 .

[81]  Rodrigo de Toledo,et al.  Extending the graphic pipeline with new GPU-accelerated primitives , 2005 .

[82]  S. Popov,et al.  Experiences with Streaming Construction of SAH KD-Trees , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[83]  Thomas S. Baldwin.  The University of North Carolina at Chapel Hill Research and Training Center on Blindness , 1980 .

[84]  Lars Arge,et al.  Cache-Oblivious Data Structures , 2004 .

[85]  Seth J. Teller,et al.  The UC Berkeley System for Interactive Visualization of Large Architectural Models , 1996, Presence: Teleoperators & Virtual Environments.

[86]  Leonard McMillan,et al.  Plenoptic Modeling: An Image-Based Rendering System , 2023 .

[87]  Dinesh Manocha,et al.  Ray tracing dynamic scenes using selective restructuring , 2007, SIGGRAPH '07.

[88]  Dinesh Manocha,et al.  Simplifying complex environments using incremental textured depth meshes , 2003, ACM Trans. Graph..

[89]  Jeffrey A. Stevens.  Visualization of Complex Automotive Data: A Tutorial , 2007, IEEE Computer Graphics and Applications.

[90]  Craig Gotsman,et al.  Efficient compression and rendering of multi-resolution meshes , 2002, IEEE Visualization, 2002. VIS 2002..

[91]  Tim Weyrich,et al.  Eurographics Symposium on Point-based Graphics (2006) Gpu-based Ray-casting of Quadratic Surfaces , 2022 .

[92]  Ivan E. Sutherland,et al.  Sketchpad: a man-machine graphical communication system , 1899, AFIPS '63 (Spring).

[93]  Rolf Niedermeier,et al.  Towards optimal locality in mesh-indexings , 2002, Discret. Appl. Math..

[94]  George Drettakis,et al.  Robust epsilon visibility , 2002, ACM Trans. Graph..

[95]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[96]  Malcolm A. Sabin,et al.  Behaviour of recursive division surfaces near extraordinary points , 1998 .

[97]  Peter J. Denning,et al.  The invisible future: the seamless integration of technology into everyday life , 2001 .

[98]  Craig Gotsman,et al.  Optimized occlusion culling using five-dimensional subdivision , 1999, Comput. Graph..

[99]  Carlos Andújar,et al.  LOD visibility culling and occluder synthesis , 2000, Comput. Aided Des..

[100]  Friedhelm Meyer auf der Heide,et al.  The randomized z-buffer algorithm: interactive rendering of highly complex scenes , 2001, SIGGRAPH.

[101]  Martin Isenburg,et al.  Streaming meshes , 2005, VIS 05. IEEE Visualization, 2005..

[102]  Renato Pajarola,et al.  Out-Of-Core Algorithms for Scientific Visualization and Computer Graphics , 2002 .

[103]  Bojan Mohar,et al.  Optimal linear labelings and eigenvalues of graphs , 1992, Discret. Appl. Math..

[104]  Michael Wimmer,et al.  Optimized HLOD Refinement Driven by Hardware Occlusion Queries , 2007, ISVC.

[105]  Robert L. Cook,et al.  Shade trees , 1984, SIGGRAPH.

[106]  Daniel Cohen-Or,et al.  Efficient cells-and-portals partitioning: Research Articles , 2006 .

[107]  Paolo Cignoni,et al.  Ray‐Casted BlockMaps for Large Urban Models Visualization , 2007, Comput. Graph. Forum.

[108]  James F. Blinn,et al.  Real-time GPU rendering of piecewise algebraic surfaces , 2006, SIGGRAPH 2006.

[109]  Wang Yi.  ACCELERATED WALKTHROUGHS OF VIRTUAL ENVIRONMENTS BASED ON VISIBILITY PREPROCESSING AND SIMPLIFICATION , 1998 .

[110]  Dinesh Manocha,et al.  Interactive visibility culling in complex environments using occlusion-switches , 2003, I3D '03.

[111]  Edwin H. Blake,et al.  Exact From-Region Visibility Culling , 2002, Rendering Techniques.

[112]  Michael Lindenbaum,et al.  On the metric properties of discrete space-filling curves , 1996, IEEE Trans. Image Process..

[113]  David J. Kasik,et al.  Strategies for consistent image partitioning , 2004, IEEE MultiMedia.

[114]  Seth J. Teller,et al.  Temporally coherent conservative visibility , 1999, Comput. Geom..

[115]  Mel Slater,et al.  View volume culling using a probabilistic caching scheme , 1997, VRST '97.

[116]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[117]  D. Manocha,et al.  RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[118]  Kathryn S. McKinley,et al.  Tile size selection using cache organization and data layout , 1995, PLDI '95.

[119]  Robert M. Abarbanel,et al.  FlyThru the Boeing 777 , 1996, SIGGRAPH '96.

[120]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[121]  Renato Pajarola,et al.  Survey of semi-regular multiresolution models for interactive terrain rendering , 2007, The Visual Computer.

[122]  Paolo Cignoni,et al.  BDAM — Batched Dynamic Adaptive Meshes for High Performance Terrain Visualization , 2003, Comput. Graph. Forum.

[123]  Ingo Wald,et al.  Realtime ray tracing and interactive global illumination , 2004, Ausgezeichnete Informatikdissertationen.

[124]  Andrew Lippman,et al.  Movie-maps: An application of the optical videodisc to computer graphics , 1980, SIGGRAPH '80.

[125]  Michael Wimmer,et al.  Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs , 2000, Rendering Techniques.

[126]  Luiz Velho,et al.  Digital halftoning with space filling curves , 1991, SIGGRAPH.

[127]  Enrico Puppo,et al.  Efficient implementation of multi-triangulations , 1998 .

[128]  Neil A. Dodgson,et al.  Advances in Multiresolution for Geometric Modelling , 2005 .

[129]  Seth J. Teller,et al.  Temporally coherent conservative visibility (extended abstract) , 1996, SCG '96.

[130]  Stephen Lin,et al.  Generalized Displacement Maps , 2004, Rendering Techniques.

[131]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[132]  Frédo Durand,et al.  3d visibility: analytical study and applications , 1999 .

[133]  Dinesh Manocha,et al.  Interactive visualization and collision detection using dynamic simplification and cache-coherent layouts , 2005 .

[134]  A. James Stewart.  Hierarchical Visibility in Terrains , 1997, Rendering Techniques.

[135]  Michael Wimmer,et al.  Layered Environment-Map Impostors for Arbitrary Scenes , 2002, Graphics Interface.

[136]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[137]  Peter Wonka,et al.  Visibility in Computer Graphics , 2003 .

[138]  E. Catmull,et al.  Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .

[139]  Valerio Pascucci,et al.  Global static indexing for real-time exploration of very large regular grids , 2001, SC.

[140]  Marta Franquesa-Niubó,et al.  Collision Prediction Using MKtrees , 2004, WSCG.

[141]  Edwin H. Blake,et al.  Hardware Accelerated Visibility Preprocessing using Adaptive Sampling , 2004, Rendering Techniques.

[142]  Alexander Keller,et al.  Instant ray tracing: the bounding interval hierarchy , 2006, EGSR '06.

[143]  William V. Baxter,et al.  HLODs for faster display of large static and dynamic environments , 2001, I3D '01.

[144]  R. Hetherington.  The Perception of the Visual World , 1952 .

[145]  Carlos Andújar,et al.  Integrating Occlusion Culling and Levels of Detail through Hardly‐Visible Sets , 2000, Comput. Graph. Forum.

[146]  I. Wald,et al.  On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[147]  Daniel Cohen-Or,et al.  A qualitative and quantitative visibility analysis in urban scenes , 1999, Comput. Graph..

[148]  Kristin A. Cook,et al.  Illuminating the Path: The Research and Development Agenda for Visual Analytics , 2005 .

[149]  Jens-Michael Wierum.  Logarithmic path-length in space-filling curves , 2002, CCCG.

[150]  Dinesh Manocha,et al.  Cache‐Efficient Layouts of Bounding Volume Hierarchies , 2006, Comput. Graph. Forum.

[151]  Philipp Slusallek,et al.  RPU: a programmable ray processing unit for realtime ray tracing , 2005, ACM Trans. Graph..

[152]  Peter Lindstrom,et al.  Out-of-core simplification of large polygonal models , 2000, SIGGRAPH.

[153]  Ji ˇ ´ Bittner,et al.  Hierarchical Techniques for Visibility Computations , 2002 .

[154]  Rémi Ronfard,et al.  Full‐range approximation of triangulated polyhedra. , 1996, Comput. Graph. Forum.

[155]  Paolo Cignoni,et al.  Adaptive TetraPuzzles - Efficient Out-of-core Construction and Visualization of Gigantic Polygonal Models , 2004 .

[156]  Michael Wimmer,et al.  Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful , 2004, Comput. Graph. Forum.

[157]  Stephen Lin,et al.  View-dependent displacement mapping , 2003, ACM Trans. Graph..

[158]  Leif Kobbelt,et al.  A Stream Algorithm for the Decimation of Massive Meshes , 2003, Graphics Interface.

[159]  Fan Wu,et al.  A Developer's Survey of Polygonal Simplification algorithms , 2005 .

[160]  Carlo H. Séquin,et al.  Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.

[161]  Dinesh Manocha,et al.  Fast collision detection between massive models using dynamic simplification , 2004, SGP '04.

[162]  Christoforos E. Kozyrakis,et al.  A case for intelligent RAM , 1997, IEEE Micro.

[163]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[164]  Dinesh Manocha,et al.  R-LODs: fast LOD-based ray tracing of massive models , 2006, SIGGRAPH '06.

[165]  Alexander Reshetov,et al.  Multi-level ray tracing algorithm , 2005, ACM Trans. Graph..

[166]  Paolo Cignoni,et al.  C‐BDAM – Compressed Batched Dynamic Adaptive Meshes for Terrain Rendering , 2006, Comput. Graph. Forum.

[167]  Paolo Cignoni,et al.  Planet-sized batched dynamic adaptive meshes (P-BDAM) , 2003, IEEE Visualization, 2003. VIS 2003..

[168]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[169]  Dinesh Manocha,et al.  GAPS: general and automatic polygonal simplification , 1999, SI3D.

[170]  Paolo Cignoni,et al.  Batched multi triangulation , 2005, VIS 05. IEEE Visualization, 2005..

[171]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[172]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[173]  Meenakshisundaram Gopi,et al.  Constrained strip generation and management for efficient interactive 3D rendering , 2005, International 2005 Computer Graphics.

[174]  William Morris.  The American Heritage dictionary of the English language , 1969 .

[175]  David J. Kasik,et al.  A flexible approach to alliances of complex applications , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[176]  Hugues Hoppe,et al.  New quadric metric for simplifying meshes with appearance attributes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[177]  François X. Sillion,et al.  Conservative volumetric visibility with occluder fusion , 2000, SIGGRAPH.

[178]  Tomas Akenine-Möller,et al.  Optimized View Frustum Culling Algorithms for Bounding Boxes , 2000, J. Graphics, GPU, & Game Tools.

[179]  Adarsh Krishnamurthy,et al.  Direct evaluation of NURBS curves and surfaces on the GPU , 2007, Symposium on Solid and Physical Modeling.

[180]  Vlastimil Havran,et al.  Heuristic ray shooting algorithms , 2000 .

[181]  Richard Szeliski,et al.  Layered depth images , 1998, SIGGRAPH.

[182]  Markus Wagner,et al.  Interactive Rendering with Coherent Ray Tracing , 2001, Comput. Graph. Forum.

[183]  Richard Szeliski,et al.  The lumigraph , 1996, SIGGRAPH.

[184]  Peter Winkler,et al.  Optimal linear arrangement of a rectangular grid , 2000, Discret. Math..

[185]  Yuan Zhou,et al.  Quadric-based simplification in any dimension , 2005, TOGS.

[186]  Michael Wimmer,et al.  Visibility preprocessing for urban scenes using line space subdivision , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

[187]  Jung Hong Chuang.  Level of Detail for 3D Graphics , 2002 .

[188]  Daniel G. Aliaga,et al.  MMR: an interactive massive model rendering system using geometric and image-based acceleration , 1999, SI3D.

[189]  Timo Aila,et al.  A hardware architecture for surface splatting , 2007, SIGGRAPH 2007.

[190]  W.R. Mark,et al.  Fast kd-tree Construction with an Adaptive Error-Bounded Heuristic , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[191]  Bruno Lévy,et al.  Iterative Methods for Visualization of Implicit Surfaces On GPU , 2007, ISVC.

[192]  Hugues Hoppe,et al.  Optimization of mesh locality for transparent vertex caching , 1999, SIGGRAPH.

[193]  Marc Levoy,et al.  Light field rendering , 1996, SIGGRAPH.

[194]  Tomas Akenine-Möller,et al.  Real-Time Rendering, Second Edition , 2002 .

[195]  Ingo Wald,et al.  Ray tracing deformable scenes using dynamic bounding volume hierarchies , 2007, TOGS.

[196]  Steven J. Gortler,et al.  Geometry images , 2002, SIGGRAPH.

[197]  George Drettakis,et al.  Interactive Sampling and Rendering for Complex and Procedural Geometry , 2001, Rendering Techniques.

[198]  Eugene Zhang,et al.  Visibility-guided simplification , 2002, IEEE Visualization, 2002. VIS 2002..

[199]  Beat D. Brüderlin,et al.  Interviews3D: A Platform for Interactive Handling of Massive Data Sets , 2007, IEEE Computer Graphics and Applications.

[200]  Michael Garland,et al.  Simplifying surfaces with color and texture using quadric error metrics , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[201]  Michael A. Bender,et al.  Efficient Tree Layout in a Multilevel Memory Hierarchy , 2002, ESA.

[202]  Marc Levoy,et al.  QSplat: a multiresolution point rendering system for large meshes , 2000, SIGGRAPH.

[203]  H. Sagan.  Space-filling curves , 1994 .

[204]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[205]  William J. Dally,et al.  Point Sample Rendering , 1998, Rendering Techniques.

[206]  Wolfgang Straßer.  Schnelle Kurven- und Flächendarstellung auf grafischen Sichtgeräten , 1974 .

[207]  Cláudio T. Silva,et al.  The Prioritized-Layered Projection Algorithm for Visible Set Estimation , 2000, IEEE Trans. Vis. Comput. Graph..

[208]  Gavin S. P. Miller,et al.  Hierarchical Z-buffer visibility , 1993, SIGGRAPH.

[209]  Ingo Wald,et al.  Exploring a Boeing 777: Ray Tracing Large-Scale CAD Data , 2007, IEEE Computer Graphics and Applications.

[210]  Seth J. Teller,et al.  Computing the antipenumbra of an area light source , 1992, SIGGRAPH.

[211]  Dinesh Manocha,et al.  Quick-VDR: out-of-core view-dependent rendering of gigantic models , 2005, IEEE Transactions on Visualization and Computer Graphics.

[212]  Beverly Sackler,et al.  Ray Space Factorization for From-Region Visibility , 2002 .

[213]  Daniel Cohen-Or,et al.  Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes , 1998, Comput. Graph. Forum.