Abstract
Sparse Voxel Directed Acyclic Graphs (SVDAGs) losslessly compress highly detailed geometry in a high-resolution binary voxel grid by identifying matching elements. This representation is suitable for high-performance real-time applications, such as free-viewpoint videos and high-resolution precomputed shadows. In this work, we introduce a lossy scheme to further decrease memory consumption by minimally modifying the underlying voxel grid to increase matches. Our method efficiently identifies groups of similar but rare subtrees in an SVDAG structure and replaces them with a single common subtree representative. We test our compression strategy on several standard voxel datasets, where we obtain memory reductions of 10% up to 50% compared to a standard SVDAG, while introducing an error (ratio of modified voxels to voxel count) of only 1% to 5%. Furthermore, we show that our method is complementary to other state of the art SVDAG optimizations, and has a negligible effect on real-time rendering performance.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, Lossy Geometry Compression for High Resolution Voxel Scenes
- Chandrajit Bajaj, Insung Ihm, and Sanghun Park. 2001. Visualization-specific compression of large volume data. In Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001. IEEE, 212--222.Google Scholar
Cross Ref
- Rafael Ballester-Ripoll, Peter Lindstrom, and Renato Pajarola. 2019. TTHRESH: Tensor Compression for Multidimensional Visual Data. IEEE transactions on visualization and computer graphics (2019).Google Scholar
- M Balsa Rodríguez, Enrico Gobbetti, JA Iglesias Guitián, Maxim Makhinya, Fabio Marton, Renato Pajarola, and Susanne K Suter. 2014. State-of-the-art in compressed GPU-based direct volume rendering. In Computer Graphics Forum, Vol. 33. Wiley Online Library, 77--100.Google Scholar
- Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008, 10 (2008), P10008.Google Scholar
Digital Library
- Cyril Crassin, Fabrice Neyret, Sylvain Lefebvre, and Elmar Eisemann. 2009. Gigavoxels: Ray-guided streaming for efficient and detailed voxel rendering. In Proceedings of the 2009 symposium on Interactive 3D graphics and games. ACM, 15--22.Google Scholar
Digital Library
- Cyril Crassin, Fabrice Neyret, Miguel Sainz, and Elmar Eisemann. 2010. Gpu pro. AK Peters, inbook X.3 Efficient Rendering of Highly Detailed Volumetric Scenes with GigaVoxels, 643--676. http://graphics.tudelft.nl/Publications-new/2010/CNSE10aGoogle Scholar
- Cyril Crassin, Fabrice Neyret, Miguel Sainz, Simon Green, and Elmar Eisemann. 2011. Interactive indirect illumination using voxel cone tracing. In Computer Graphics Forum, Vol. 30. Wiley Online Library, 1921--1930.Google Scholar
- Bas Dado, Timothy R Kol, Pablo Bauszat, Jean-Marc Thiery, and Elmar Eisemann. 2016. Geometry and attribute compression for voxel scenes. In Computer Graphics Forum, Vol. 35. Wiley Online Library, 397--407.Google Scholar
- Dan Dolonius, Erik Sintorn, Viktor Kampe, and Ulf Assarsson. 2017. Compressing Color Data for Voxelized Surface Geometry. IEEE transactions on visualization and computer graphics (2017).Google Scholar
Digital Library
- Stijn Dongen. 2000. A cluster algorithm for graphs. (2000).Google Scholar
- Enrico Gobbetti, Fabio Marton, and José Antonio Iglesias Guitián. 2008. A single-pass GPU ray casting framework for interactive out-of-core rendering of massive volumetric datasets. The Visual Computer 24, 7-9 (2008), 797--806.Google Scholar
Digital Library
- Stefan Guthe, Michael Wand, Julius Gonser, and Wolfgang Straßer. 2002. Interactive rendering of large volume data sets. In Proceedings of the Conference on Visualization'02. IEEE Computer Society, 53--60.Google Scholar
Digital Library
- Viktor Kämpe, Sverker Rasmuson, Markus Billeter, Erik Sintorn, and Ulf Assarsson. 2016a. Exploiting coherence in time-varying voxel data. In Proceedings of the 20th ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games. ACM, 15--21.Google Scholar
Digital Library
- Viktor Kämpe, Erik Sintorn, and Ulf Assarsson. 2013. High resolution sparse voxel DAGs. ACM Transactions on Graphics (TOG) 32, 4 (2013), 101.Google Scholar
Digital Library
- Viktor Kämpe, Erik Sintorn, Dan Dolonius, and Ulf Assarsson. 2016b. Fast, memory-efficient construction of voxelized shadows. IEEE transactions on visualization and computer graphics 22, 10 (2016), 2239--2248.Google Scholar
Digital Library
- Timothy R. Kol, Pablo Bauszat, Sungkil Lee, and Elmar Eisemann. 2019. MegaViews: Scalable Many-View Rendering With Concurrent Scene-View Hierarchy Traversal. Computer Graphics Forum 38, 1 (2019), 235--247.Google Scholar
Cross Ref
- Samuli Laine and Tero Karras. 2011. Efficient sparse voxel octrees. IEEE Transactions on Visualization and Computer Graphics 17, 8 (2011), 1048--1059.Google Scholar
Digital Library
- G. Nader, K. Wang, F. Hétroy-Wheeler, and f. Dupont. 2016. Visual Contrast Sensitivity and Discrimination for 3D Meshes and their Applications. Computer Graphics Forum 35, 7 (2016), 497--506.Google Scholar
Digital Library
- Leonardo Scandolo, Pablo Bauszat, and Elmar Eisemann. 2016. Merged multiresolution hierarchies for shadow map compression. In Computer Graphics Forum, Vol. 35. Wiley Online Library, 383--390.Google Scholar
- Ruwen Schnabel and Reinhard Klein. 2006. Octree-based Point-Cloud Compression. Spbg 6 (2006), 111--120.Google Scholar
Digital Library
- Erik Sintorn, Viktor Kämpe, Ola Olsson, and Ulf Assarsson. 2014. Compact precomputed voxelized shadows. ACM Transactions on Graphics (TOG) 33, 4 (2014), 150.Google Scholar
Digital Library
- Alberto Jaspe Villanueva, Fabio Marton, and Enrico Gobbetti. 2016. SSVDAGs: symmetry-aware sparse voxel DAGs. In Proceedings of the 20th ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games. ACM, 7--14.Google Scholar
Digital Library
- Brent Robert Williams. 2015. Moxel DAGs: Connecting material information to high resolution sparse voxel DAGs. (2015).Google Scholar
Index Terms
Lossy Geometry Compression for High Resolution Voxel Scenes
Recommendations
High resolution sparse voxel DAGs
We show that a binary voxel grid can be represented orders of magnitude more efficiently than using a sparse voxel octree (SVO) by generalising the tree to a directed acyclic graph (DAG). While the SVO allows for efficient encoding of empty regions of ...
SSVDAGs: symmetry-aware sparse voxel DAGs
I3D '16: Proceedings of the 20th ACM SIGGRAPH Symposium on Interactive 3D Graphics and GamesVoxelized representations of complex 3D scenes are widely used nowadays to accelerate visibility queries in many GPU rendering techniques. Since GPU memory is limited, it is important that these data structures can be kept within a strict memory budget. ...
Geometry and attribute compression for voxel scenes
EG '16: Proceedings of the 37th Annual Conference of the European Association for Computer GraphicsVoxel-based approaches are today's standard to encode volume data. Recently, directed acyclic graphs (DAGs) were successfully used for compressing sparse voxel scenes as well, but they are restricted to a single bit of (geometry) information per voxel. ...






Comments