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 compu...
Saved in:
Published in | 2011 15th International Conference on System Theory, Control, and Computing pp. 1 - 5 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.10.2011
|
Subjects | |
Online Access | Get full text |
ISBN | 9781457711732 1457711737 |
Cover
Summary: | 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. |
---|---|
ISBN: | 9781457711732 1457711737 |