Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/140083| Title: | A novel data structure for voxel rendering |
| Authors: | Farrugia, Keith (2025) |
| Keywords: | Data structures (Computer science) Computer graphics Three-dimensional display systems Computer graphics -- Data processing |
| Issue Date: | 2025 |
| Citation: | Farrugia, K. (2025). A novel data structure for voxel rendering (Bachelor’s dissertation). |
| Abstract: | This project presents a novel data structure implementation designed specifically for voxel‐based rendering. The primary aim is to develop a dynamic system capable of managing voxel data efficiently while supporting real‐time 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‐level 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‐of‐detail (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‐time applications, offering a solid foundation for further development and experimentation. |
| Description: | B.Sc. (Hons)(Melit.) |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/140083 |
| Appears in Collections: | Dissertations - FacICT - 2025 Dissertations - FacICTCS - 2025 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2508ICTICT391400017706_1.PDF Restricted Access | 4.09 MB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
