000 04035naa a22005177i 4500
001 UMUN-OA-20261005-CS-024
003 local
005 20261005174811.0
006 m o d
007 cr||||||||||||
008 261005s2021 xx o u000 0 eng d
024 7 _a10.3390/s21248241
_2doi
035 _a(local)OpenAlex:W4200563051
040 _alocal
_beng
_clocal
041 0 _aeng
100 0 _aMitko Aleksandrov
_eauthor.
245 1 0 _aVoxelisation Algorithms and Data Structures: A Review /
_cMitko Aleksandrov; Sisi Zlatanova; David J. Heslop.
264 1 _a[Place of publication not identified] :
_bMultidisciplinary Digital Publishing Institute,
_c2021.
300 _a1 online resource (1 article).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aPublication type: Journal article.
500 _aLinked open-access copy: published version.
506 0 _aOpen access; no subscription required for the linked open-access version.
_fUnrestricted online access
_2star
520 3 _aVoxel-based data structures, algorithms, frameworks, and interfaces have been used in computer graphics and many other applications for decades. There is a general necessity to seek adequate digital representations, such as voxels, that would secure unified data structures, multi-resolution options, robust validation procedures and flexible algorithms for different 3D tasks. In this review, we evaluate the most common properties and algorithms for voxelisation of 2D and 3D objects. Thus, many voxelisation algorithms and their characteristics are presented targeting points, lines, triangles, surfaces and solids as geometric primitives. For lines, we identify three groups of algorithms, where the first two achieve different voxelisation connectivity, while the third one presents voxelisation of curves. We can say that surface voxelisation is a more desired voxelisation type compared to solid voxelisation, as it can be achieved faster and requires less memory if voxels are stored in a sparse way. At the same time, we evaluate in the paper the available voxel data structures. We split all data structures into static and dynamic grids considering the frequency to update a data structure. Static grids are dominated by SVO-based data structures focusing on memory footprint reduction and attributes preservation, where SVDAG and SSVDAG are the most advanced methods. The state-of-the-art dynamic voxel data structure is NanoVDB which is superior to the rest in terms of speed as well as support for out-of-core processing and data management, which is the key to handling large dynamically changing scenes. Overall, we can say that this is the first review evaluating the available voxelisation algorithms for different geometric primitives as well as voxel data structures.
540 _aCreative Commons Attribution (licence family recorded by the source; version not supplied in metadata).
_uhttps://openalex.org/W4200563051
546 _aIn English.
588 0 _aDescription generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.
590 _aCourse allocation: B. Sc. Computer Science.
650 4 _avoxelization
650 4 _avoxel grid
650 4 _asparse voxel octree
650 4 _aout-of-core computation
650 4 _ageometric primitives
653 _aB. Sc. Computer Science
653 _aUMUN open access collection
653 _adata structures
655 4 _aJournal articles.
700 0 _aSisi Zlatanova
_eauthor.
700 0 _aDavid J. Heslop
_eauthor.
773 0 _tSensors
_gVol. 21, no. 24, (2021), pages/article 8241
_x1424-8220
856 4 0 _uhttps://www.mdpi.com/1424-8220/21/24/8241/pdf?version=1639066829
_yRead open-access publication
_zOpen access.
_70
_qapplication/pdf
884 _aCourse selection and automated MARC21 enrichment from OpenAlex metadata.
_g20261005
_khttps://openalex.org/W4200563051
_qlocal
942 _n0
999 _c386
_d386