A fast voxelization algorithm for trilinearly interpolated isosurfaces - Archive ouverte HAL Access content directly
Journal Articles The Visual Computer Year : 2018

A fast voxelization algorithm for trilinearly interpolated isosurfaces


In this work we propose a new method for a fast incremental voxelization of isosurfaces obtained by the trilinear interpolation of 3D data. Our objective consists in the fast generation of subvoxelized iso-surfaces extracted by a point-based technique similar to the Dividing Cubes algorithm. Our technique involves neither an exhaustive scan search process nor a graph-based search approach when generating iso-surface points. Instead an optimized incremental approach is adopted here for a rapid isosurface extraction. With a sufficient sampling subdivision criteria around critical points, the extracted isosurface is both correct and topologically consistent with respect to the piece-wise trilinear interpolant. Furthermore, the discretiza-tion scheme used in our method ensures obtaining thin-one voxel width-isosurfaces as compared to the given by the Dividing Cubes algorithm. The resultant sub-voxelized isosurfaces are efficiently tested against all possible configurations of the trilinear interpolant and real-world datasets.
Fichier principal
Vignette du fichier
TVCJ-Namane-Miguet-Boumghar.pdf (3.26 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01385184 , version 1 (20-10-2016)





Rachid Namane, Serge Miguet, Fatima Boumghar Oulebsir. A fast voxelization algorithm for trilinearly interpolated isosurfaces. The Visual Computer, 2018, ⟨10.1007/s00371-016-1306-0⟩. ⟨hal-01385184⟩
169 View
769 Download



Gmail Facebook Twitter LinkedIn More