Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1507149.1507153acmconferencesArticle/Chapter ViewAbstractPublication Pagesi3dConference Proceedingsconference-collections
research-article

A novel page-based data structure for interactive walkthroughs

Published: 27 February 2009 Publication History

Abstract

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.

Supplementary Material

JPG File (p23-sajadi.jpg)
WMV File (p23-sajadi.wmv)

References

[1]
Aliaga, D., and Lastra, A. 1997. Architectural Walkthroughs using Portal Textures. In Proc. IEEE Visualization, 355--362.
[2]
Bentley, J. 1975. Multidimensional binary search trees used for associative searching. Communications of the ACM 18, 9, 509--517.
[3]
Bittner, J., Wimmer, M., Piringer, H., and Purgathofer, W. 2004. Coherent hierarchical culling: Hardware occlusion queries made useful. Computer Graphics Forum (Eurographics) 23, 3, 615--624.
[4]
Cignoni, P., Ganovelli, F., Gobbetti, E., Marton, F., Ponchio, F., and Scopigno, R. 2004. Adaptive TetraPuzzles -- efficient out-of-core construction and visualization of gigantic polygonal models. ACM Transactions on Graphics 23, 3.
[5]
Corrêa, W. T., Klosowski, J. T., and Silva, C. T. 2003. Visibility-based prefetching for interactive out-of-core rendering. In IEEE Symp. on Parallel and Large-Data Visualization and Graphics), 1--8.
[6]
Deering, M. F. 1995. Geometry compression. In ACM SIGGRAPH, 13--20.
[7]
Diaz-Gutierrez, P., and Gopi, M. 2005. Quadrilateral and tetrahedral mesh stripification using 2-factor partitioning of the dual graph. The Visual Computer 21, 8--10, 689--697.
[8]
Diaz-Gutierrez, P., Bhushan, A., Gopi, M., and Pajarola, R. 2005. Constrained Strip Generation and Management for Efficient Interactive 3D Rendering. In Proc. of Computer Graphics International Conference, 115--121.
[9]
Diaz-Gutierrez, P., Gopi, M., and Pajarola, R. 2005. Hierarchiless simplification, stripification, and compression of triangulated two manifolds. In Proc. of EUROGRAPHICS.
[10]
Diaz-Gutierrez, P., Bhushan, A., Gopi, M., and Pajarola, R. 2006. Single Strips for Fast Interactive Rendering. The Visual Computer 22, 6, 372--386.
[11]
Duchaineau, M., Wolinsky, M., Sigeti, D. E., Miller, M. C., Aldrich, C., and Mineev-Weinstein, M. B. 1997. ROAMing Terrain: Real-time Optimally Adapting Meshes. In Proc. IEEE Visualization, 81--88.
[12]
Gobbetti, E., and Marton, F. 2005. Far voxels: A multiresolution framework for interactive rendering of huge complex 3d models on commodity graphics forum. In Proc. of ACM SIGGRAPH.
[13]
Gopi, M., and Eppstein, D. 2004. Single strip triangulation of manifolds with arbitrary topology. Computer Graphics Forum (EUROGRAPHICS) 23, 3, 371--379.
[14]
Hoppe, H. 1999. Optimization of mesh locality for transparent vertex caching. ACM SIGGRAPH, 269--276.
[15]
Isenburg, M., and Lindstrom, P. 2005. Streaming meshes. IEEE Visualization, 231--238.
[16]
Isenburg, M., Lindstrom, P., Gumhold, S., and Snoeyink, J. 2003. Large mesh simplification using processing sequences. IEEE Visualization, 465--472.
[17]
Lin, M., and Manocha, D. 2003. Collision and proximity queries. In Handbook of Discrete and Computational Geometry.
[18]
Lindstrom, P., and Pascucci, V. 2001. Visualization of large terrains made easy. IEEE Visualization, 363--370.
[19]
Losasso, F., and Hoppe, H. 2004. Geometry clipmaps: Terrain rendering using nested regular grids. In ACM SIGGRAPH, 269--776.
[20]
Luebke, D., and Erikson, C. 1997. View-dependent simplification of arbitrary polygonal environments. In SIGGRAPH '97: Proceedings of the 24th annual conference on Computer graphics and interactive techniques, ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 199--208.
[21]
Luebke, D., Reddy, M., Cohen, J., Varshney, A., Watson, B., and Huebner, R. 2002. Level of Detail for 3D Graphics. Morgan-Kaufmann.
[22]
Otaduy, M. A., and Lin, M. C. 2003. CLODs: Dual hierarchies for multiresolution collision detection. Eurographics Symposium on Geometry Processing, 94--101.
[23]
Pascucci, V., and Frank, R. J. 2001. Global static indexing for real-time exploration of very large regular grids. In Super-computing.
[24]
Sagan, H. 1994. Space-Filling Curves. Springer-Verlag.
[25]
Samet, H. 2006. Foundations of MultiDimensional and Metric Data Structures. Morgan Kaufmann.
[26]
Sander, P. V., Nehab, D., and Barczak, J. 2007. Fast triangle reordering for vertex locality and reduced overdraw. ACM Trans. on Graphics (SIGGRAPH) 26, 3, 89.
[27]
Teschner, M., Kimmerle, S., Heidelberger, B., Zachmann, G., Raghupathi, L., Fuhrmann, A., Cani, M.-P., Faure, F., Magnenat-Thalmann, N., Strasser, W., and Volino, P. 2005. Collision detection for deformable objects. Computer Graphics Forum 19, 1, 61--81.
[28]
Varadhan, G., and Manocha, D. 2002. Out-of-core rendering of massive geometric environments. In IEEE Visualization.
[29]
Velho, L., and de Miranda Gomes, J. 1991. Digital halftoning with space filling curves. In ACM SIGGRAPH, 81--90.
[30]
Wald, I., and Havran, V. 2006. On building fast kd-trees for ray tracing, and on doing that in O(N log N). In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, 61--69.
[31]
Walter, B., Bala, K., Kulkarni, M., and Pingali, K. 2008. Fast agglomerative clustering for rendering. IEEE Symp. on Interactive Ray Tracing, 81--86.
[32]
Yoon, S.-E., and Lindstrom, P. 2006. Mesh layouts for block-based caches. IEEE Transactions on Visualization and Computer Graphics (Proceedings Visualization) 12, 5.
[33]
Yoon, S.-E., Lindstrom, P., Pascucci, V., and Manocha, D. 2005. Cache-Oblivious Mesh Layouts. ACM Transactions on Graphics (SIGGRAPH) 24, 3, 886--893.
[34]
Yoon, S., Gobbetti, E., Kasik, D., and Manocha, D. 2008. Real-Time Massive Model Rendering. Morgan & Claypool Publisher.

Cited By

View all
  • (2016)Topological triangle sorting for predefined camera pathsProceedings of the Conference on Vision, Modeling and Visualization10.5555/3056901.3056927(153-160)Online publication date: 10-Oct-2016
  • (2014)Optimizing redundant-data clustering for interactive walkthrough applicationsThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-014-0949-y30:6-8(637-647)Online publication date: 1-Jun-2014
  • (2013)Utilizing Traveral Sequence Order for Storage Layout in WalkthroughApplied Mechanics and Materials10.4028/www.scientific.net/AMM.311.147311(147-152)Online publication date: Mar-2013
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
I3D '09: Proceedings of the 2009 symposium on Interactive 3D graphics and games
February 2009
253 pages
ISBN:9781605584294
DOI:10.1145/1507149
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. data layouts
  2. out-of-core algorithms
  3. spatial data structures
  4. walkthrough systems

Qualifiers

  • Research-article

Funding Sources

Conference

I3D '09
Sponsor:
I3D '09: Symposium on Interactive 3D Graphics and Games
February 27 - March 1, 2009
Massachusetts, Boston

Acceptance Rates

Overall Acceptance Rate 148 of 485 submissions, 31%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2016)Topological triangle sorting for predefined camera pathsProceedings of the Conference on Vision, Modeling and Visualization10.5555/3056901.3056927(153-160)Online publication date: 10-Oct-2016
  • (2014)Optimizing redundant-data clustering for interactive walkthrough applicationsThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-014-0949-y30:6-8(637-647)Online publication date: 1-Jun-2014
  • (2013)Utilizing Traveral Sequence Order for Storage Layout in WalkthroughApplied Mechanics and Materials10.4028/www.scientific.net/AMM.311.147311(147-152)Online publication date: Mar-2013
  • (2013)Single-Seek Data Layout for Walkthrough ApplicationsProceedings of the 2013 XXVI Conference on Graphics, Patterns and Images10.1109/SIBGRAPI.2013.44(266-273)Online publication date: 5-Aug-2013
  • (2012)Clustering spatial data for aggregate query processing in walkthroughTransactions on Edutainment VII10.5555/2231115.2231124(86-98)Online publication date: 1-Jan-2012
  • (2012)Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D ScenesAdvances in Visual Computing10.1007/978-3-642-33179-4_48(502-512)Online publication date: 2012
  • (2012)Clustering Spatial Data for Aggregate Query Processing in Walkthrough: A Hypergraph ApproachTransactions on Edutainment VII10.1007/978-3-642-29050-3_8(86-98)Online publication date: 2012
  • (2012)Intelligent-Based Visual Pattern Clustering for Storage Layouts in Virtual EnvironmentsComputational Social Networks10.1007/978-1-4471-4054-2_11(269-290)Online publication date: 14-Jun-2012
  • (2011)Data management for SSDs for large-scale interactive graphics applicationsSymposium on Interactive 3D Graphics and Games10.1145/1944745.1944775(175-182)Online publication date: 18-Feb-2011
  • (2010)Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive EnvironmentsProceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage10.1109/NAS.2010.52(448-456)Online publication date: 15-Jul-2010

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media