Marching cubes: A high resolution 3D surface construction algorithm

DMCA

Marching cubes: A high resolution 3D surface construction algorithm (1987)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by William E. Lorensen , Harvey E. Cline

Venue:	COMPUTER GRAPHICS
Citations:	2652 - 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}
}

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.

Keyphrases

high resolution surface construction algorithm inter-slice connectivity medical data case table linear interpolation scan-line order triangle model triangle topology marching cube generated surface model solid modeling capability constant density surface surface data processing time magnetic resonance original data computed tomography gradient information present single-photon emission divide-and-conquer approach new algorithm

DMCA