Real time reconstruction of volumes from very large datasets using CUDA
暂无分享,去创建一个
This article presents a memory efficient implementation of the Marching Cubes algorithm using NVIDIA's CUDA technology. The algorithm can handle datasets that are normally too large for current hardware by splitting the initial volume into several smaller subvolumes while minimizing extra computations caused by subvolume overlapping. Moreover, our approach is scalable, making it easy to benefit from additional computational resources.
[1] William E. Lorensen,et al. Marching cubes: a high resolution 3D surface construction algorithm , 1996 .
[2] GPU Optimized Marching Cubes Algorithm for Handling Very Large , Temporal Datasets , 2008 .
[3] Lixu Gu,et al. GPU-based Volume Rendering for Medical Image Visualization , 2005, 2005 IEEE Engineering in Medicine and Biology 27th Annual Conference.
[4] Patrick S. McCormick,et al. Load-Balanced Isosurfacing on Multi-GPU Clusters , 2010, EGPGV@Eurographics.