A novel data structure for voxel rendering

Abstract

This project presents a novel data structure implementation designed specifically for voxel鈥恇ased rendering. The primary aim is to develop a dynamic system capable of managing voxel data efficiently while supporting real鈥恡ime updates and rendering. By leveraging a tiered hierarchy of sectors, chunks, and compact voxel arrays, the system allows for fast access, minimal memory overhead, and smooth integration with a mesh generation pipeline. Key features include spatial indexing, chunk鈥恖evel organisation, and dynamic streaming, all geared towards maintaining responsiveness in large or procedurally generated worlds. To evaluate the effectiveness of the design, a range of configurations and workloads were tested, including variations in voxel storage models, mesh generation strategies, and level鈥恛f鈥恉etail (LOD) approaches. Benchmarks were gathered to assess memory usage, update times, and mesh complexity across different scenarios. While the implementation does not aim to outperform all alternatives, it prioritises simplicity, extensibility, and practical performance for real鈥恡ime applications, offering a solid foundation for further development and experimentation.