Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures

Abstract Compressed voxel structures make it possible to store, interact with and display detailed and complex geometry. The Sparse Voxel DAG (directed acyclic graph) is such a compressed representation that supports real‐time rendering and interactive editing of high‐resolution voxel geometry. We present a novel encoding of the Sparse Voxel DAG that utilises the memory location of data to encode information about the structure of the voxel geometry. This encoding is not only more compact but also makes it possible to avoid memory accesses. In turn, this improves traversal performance, which we can observe in terms of increased ray tracing speed. Our new encoding retains compatibility with other existing methods. We demonstrate an adaption to the HashDAG data structure and show that our proposed encoding also results in better editing speed at similar memory requirements in this framework. Further, we demonstrate its compatibility with existing methods for storing voxel attributes such as colours.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2025-11-21
DOI
https://doi.org/10.1111/cgf.70292
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures

Markus Billeter, Jaina Modisett
Computer Graphics Forum
Computer Graphics and Visualization Techniques
article

Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures

Markus Billeter, Jaina Modisett
article en

Abstract

Abstract Compressed voxel structures make it possible to store, interact with and display detailed and complex geometry. The Sparse Voxel DAG (directed acyclic graph) is such a compressed representation that supports real‐time rendering and interactive editing of high‐resolution voxel geometry. We present a novel encoding of the Sparse Voxel DAG that utilises the memory location of data to encode information about the structure of the voxel geometry. This encoding is not only more compact but also makes it possible to avoid memory accesses. In turn, this improves traversal performance, which we can observe in terms of increased ray tracing speed. Our new encoding retains compatibility with other existing methods. We demonstrate an adaption to the HashDAG data structure and show that our proposed encoding also results in better editing speed at similar memory requirements in this framework. Further, we demonstrate its compatibility with existing methods for storing voxel attributes such as colours.

Computer Graphics Forum
University of Leeds (GB)
Openalex Percentile: Top 43%
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures — Markus Billeter, Jaina Modisett · Computer Graphics Forum (2025) | TGRS Research Map | TGRS