A novel page-based data structure for interactive walkthroughs

Given a data layout of a large walkthrough scene, we present a novel and simple spatial hierarchy on the disk-pages of the layout that has notable advantages over a conventional spatial hierarchy on the scene geometry. Assume that each disk-page consists of a set of triangles whose bounding boxes are computed. A spatial hierarchy of the walkthrough space is constructed, not with the given scene, but with the bounding boxes of disk-pages. The leaf nodes of the spatial-hierarchy refer directly to the page numbers of the pages of the bounding box it contains. We call this hierarchy on the pages as the disk-page hierarchy. We also propose a self-contained disk-page format that would suit this data structure well. Further, we present a new cache-oblivious graph-based data layout algorithm called the 2-factor layout that would preserve the proximity and orientation properties of the primitives in the layout. Walkthrough experiments have been conducted on a city scene consisting of over 110M triangles. Our system renders this scene on a laptop within a one pixel projection error at over 20 fps with simple texture substitution based simplification of distant objects, and with no explicit data/cache management.

[1]  Dinesh Manocha,et al.  Out-of-core rendering of massive geometric environments , 2002, IEEE Visualization, 2002. VIS 2002..

[2]  Meenakshisundaram Gopi,et al.  Quadrilateral and tetrahedral mesh stripification using 2-factor partitioning of the dual graph , 2005, The Visual Computer.

[3]  David P. Luebke,et al.  View-dependent simplification of arbitrary polygonal environments , 1997, SIGGRAPH.

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

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

[6]  B. Walter,et al.  Fast agglomerative clustering for rendering , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

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

[8]  Ming C. Lin,et al.  CLODs: Dual Hierarchies for Multiresolution Collision Detection , 2003, Symposium on Geometry Processing.

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

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

[11]  David Eppstein,et al.  Single-strip triangulation of manifolds with arbitrary topology , 2004, SCG '04.

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

[13]  Frank Losasso,et al.  Geometry clipmaps: terrain rendering using nested regular grids , 2004, SIGGRAPH 2004.

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

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

[16]  Dinesh Manocha,et al.  Real-Time Massive Model Rendering , 2008, Real-Time Massive Model Rendering.

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

[18]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

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

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

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

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

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

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

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

[26]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[27]  Pedro V. Sander,et al.  Fast triangle reordering for vertex locality and reduced overdraw , 2007, SIGGRAPH 2007.

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

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

[30]  Meenakshisundaram Gopi,et al.  Hierarchyless Simplification, Stripification and Compression of Triangulated Two‐Manifolds , 2005, Comput. Graph. Forum.

[31]  Dinesh Manocha,et al.  Collision and Proximity Queries , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[32]  Meenakshisundaram Gopi,et al.  Single-strips for fast interactive rendering , 2006, The Visual Computer.

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

[34]  Gabriel Zachmann,et al.  Collision Detection for Deformable Objects , 2004, Comput. Graph. Forum.

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

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