Marching cubes: A high resolution 3D surface construction algorithm (1987)
Cached
Download Links
- [www.cs.sfu.ca]
- [www.cs.stevens.edu]
- [www.csee.wvu.edu]
- [www.cs.stevens-tech.edu]
- [www.cs.stevens.edu]
- [www-lmc.imag.fr]
- [www-static.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cs.uncc.edu]
- [www.cs.berkeley.edu]
- [www.cs.duke.edu]
- [www.cs.virginia.edu]
- [ljk.imag.fr]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | COMPUTER GRAPHICS |
| Citations: | 1746 - 4 self |
BibTeX
@ARTICLE{Lorensen87marchingcubes:,
author = {William E. Lorensen and Harvey E. Cline},
title = {Marching cubes: A high resolution 3D surface construction algorithm},
journal = {COMPUTER GRAPHICS},
year = {1987},
volume = {21},
number = {4},
pages = {163--169}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divide-and-conquer approach to generate inter-slice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical data in scan-line order and calculates triangle vertices using linear interpolation. We find the gradient of the original data, normalize it, and use it as a basis for shading the models. The detail in images produced from the generated surface models is the result of maintaining the inter-slice connectivity, surface data, and gradient information present in the original 3D data. Results from computed tomography (CT), magnetic resonance (MR), and single-photon emission computed tomography (SPECT) illustrate the quality and functionality of marching cubes. We also discuss improvements that decrease processing time and add solid modeling capabilities.
