Far voxels: a multiresolution framework for interactive rendering of huge complex 3D models on commodity graphics platforms

We present an efficient approach for end-to-end out-of-core construction and interactive inspection of very large arbitrary surface models. The method tightly integrates visibility culling and out-of-core data management with a level-of-detail framework. At preprocessing time, we generate a coarse volume hierarchy by binary space partitioning the input triangle soup. Leaf nodes partition the original data into chunks of a fixed maximum number of triangles, while inner nodes are discretized into a fixed number of cubical voxels. Each voxel contains a compact direction dependent approximation of the appearance of the associated volumetric subpart of the model when viewed from a distance. The approximation is constructed by a visibility aware algorithm that fits parametric shaders to samples obtained by casting rays against the full resolution dataset. At rendering time, the volumetric structure, maintained off-core, is refined and rendered in front-to-back order, exploiting vertex programs for GPU evaluation of view-dependent voxel representations, hardware occlusion queries for culling occluded subtrees, and asynchronous I/O for detecting and avoiding data access latencies. Since the granularity of the multiresolution structure is coarse, data management, traversal and occlusion culling cost is amortized over many graphics primitives. The efficiency and generality of the approach is demonstrated with the interactive rendering of extremely complex heterogeneous surface models on current commodity graphics platforms.

[1]  Kellogg S. Booth,et al.  Heuristics for ray tracing using space subdivision , 1990, The Visual Computer.

[2]  Xavier Tricoche,et al.  Interactive point-based isosurface extraction , 2004, IEEE Visualization 2004.

[3]  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..

[4]  Pat Hanrahan,et al.  Rendering complex scenes with memory-coherent ray tracing , 1997, SIGGRAPH.

[5]  David Salesin,et al.  Surface light fields for 3D photography , 2000, SIGGRAPH.

[6]  Reinhard Klein,et al.  Real-time appearance preserving out-of-core rendering with shadows , 2004, Rendering Techniques.

[7]  Daniel G. Aliaga,et al.  Hybrid simplification: combining multi-resolution polygon and point rendering , 2001, Proceedings Visualization, 2001. VIS '01..

[8]  Marc Levoy,et al.  Streaming QSplat: a viewer for networked visualization of large, dense models , 2001, I3D '01.

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

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

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

[12]  Joshua Levenberg,et al.  Fast view-dependent level-of-detail rendering using cached geometry , 2002, IEEE Visualization, 2002. VIS 2002..

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

[14]  Steven G. Parker,et al.  Memory-Savvy Distributed Interactive Ray Tracing , 2004, EGPGV.

[15]  Vlastimil Havran,et al.  Analysis of Cache Sensitive Representation for Binary Space Partitioning Trees , 1999, Informatica.

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

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

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

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

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

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

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

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

[24]  Philippe Decaudin,et al.  Rendering Forest Scenes in Real-Time , 2010 .

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

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

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

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

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

[30]  Carlos Andújar,et al.  Topology-reducing surface simplification using a discrete solid representation , 2002, TOGS.

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

[32]  Cláudio T. Silva,et al.  Integrating occlusion culling with view-dependent rendering , 2001, Proceedings Visualization, 2001. VIS '01..

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

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