Efficient implementation of marching cubes cases with topological guarantees
Thomas Lewiner, Hélio Lopes, Antônio Wilson Vieira, Geovan Tavares
Abstract:
Marching Cubes methods first offered visual access to experimental and theoretical data. This method s implementation usually relies on a small lookup table. Many enhancements and optimizations of this method still use it. However, this lookup table can lead to cracks and inconsistent topology. This paper introduces a full implementation of Chernyaev s Marching Cubes 33 method to ensure a topologically correct result. It completes the original paper for the ambiguity resolution and for the feasibility of the implementation.Downloads:
PDF paper (576 KB)source code (166 KB)
BibTeX:
@article{marching_cubes_jgt,author = {Thomas Lewiner and Hélio Lopes and Antônio Wilson Vieira and Geovan Tavares},
title = {Efficient implementation of marching cubes cases with topological guarantees},
year = {2003},
month = {december},
journal = {Journal of Graphics Tools},
volume = {8},
number = {2},
pages = {1--15},
publisher = {A.K.Peters},
doi = {10.1080/10867651.2003.10487582},
url = {\url{http://thomas.lewiner.org/pdfs/marching_cubes_jgt.pdf}}
}