A fast voxelization algorithm for trilinearly interpolated isosurfaces

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01385184
Contributor : Serge Miguet <>
Submitted on : Thursday, October 20, 2016 - 11:30:52 PM
Last modification on : Thursday, November 21, 2019 - 2:08:19 AM

File

TVCJ-Namane-Miguet-Boumghar.pd...
Files produced by the author(s)

Licence


Copyright

Identifiers

Citation

Rachid Namane, Serge Miguet, Fatima Boumghar Oulebsir. A fast voxelization algorithm for trilinearly interpolated isosurfaces. Visual Computer, Springer Verlag, 2016, ⟨10.1007/s00371-016-1306-0⟩. ⟨hal-01385184⟩

Share

Metrics

Record views

293

Files downloads

938