{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:10:01Z","timestamp":1783105801758,"version":"3.54.6"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Comput. Graph. Interact. Tech."],"published-print":{"date-parts":[[2020,4,18]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3384541","type":"journal-article","created":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T17:44:11Z","timestamp":1616521451000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Lossy Geometry Compression for High Resolution Voxel Scenes"],"prefix":"10.1145","volume":"3","author":[{"given":"Remi","family":"van der Laan","sequence":"first","affiliation":[{"name":"Delft University of Technology, Computer Graphics and Visualization Group, Delft, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonardo","family":"Scandolo","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Computer Graphics and Visualization Group, Delft, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elmar","family":"Eisemann","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Computer Graphics and Visualization Group, Delft, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,5,4]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/PCCGA.2001.962876"},{"key":"e_1_2_2_2_1","volume-title":"TTHRESH: Tensor Compression for Multidimensional Visual Data","author":"Ballester-Ripoll Rafael","year":"2019"},{"key":"e_1_2_2_3_1","volume-title":"Maxim Makhinya, Fabio Marton, Renato Pajarola, and Susanne K Suter.","author":"Rodr\u00edguez M Balsa","year":"2014"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507149.1507152"},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"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\/CNSE10a  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\/CNSE10a","DOI":"10.1201\/b10648-50"},{"key":"e_1_2_2_7_1","volume-title":"Computer Graphics Forum","author":"Crassin Cyril","year":"1921"},{"key":"e_1_2_2_8_1","volume-title":"Computer Graphics Forum","author":"Dado Bas"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3023368.3023381"},{"key":"e_1_2_2_10_1","unstructured":"Stijn Dongen. 2000. A cluster algorithm for graphs. (2000).  Stijn Dongen. 2000. A cluster algorithm for graphs. (2000)."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-008-0261-9"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/602099.602106"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856400.2856413"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2462024"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2539955"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13527"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.240"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3151666.3151716"},{"key":"e_1_2_2_19_1","volume-title":"Computer Graphics Forum","author":"Scandolo Leonardo"},{"key":"e_1_2_2_20_1","first-page":"111","article-title":"Octree-based Point-Cloud Compression","volume":"6","author":"Schnabel Ruwen","year":"2006","journal-title":"Spbg"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601221"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856400.2856420"},{"key":"e_1_2_2_23_1","unstructured":"Brent Robert Williams. 2015. Moxel DAGs: Connecting material information to high resolution sparse voxel DAGs. (2015).  Brent Robert Williams. 2015. Moxel DAGs: Connecting material information to high resolution sparse voxel DAGs. (2015)."}],"container-title":["Proceedings of the ACM on Computer Graphics and Interactive Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384541","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3384541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:12Z","timestamp":1750199592000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,18]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4,18]]}},"alternative-id":["10.1145\/3384541"],"URL":"https:\/\/doi.org\/10.1145\/3384541","relation":{},"ISSN":["2577-6193"],"issn-type":[{"value":"2577-6193","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,18]]},"assertion":[{"value":"2020-05-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}