TY - JOUR
T1 - Practical considerations on Marching Cubes 33 topological correctness
AU - Custodio, Lis
AU - Etiene, Tiago
AU - Pesco, Sinesio
AU - Silva, Claudio
N1 - Funding Information:
The authors wish to thank Lewiner et al. for making their code available and Fernando Chirigati, Wendel Silva, Tommy Ellqvist, Harish Doraiswamy and Prof. Juliana Freire for their valuable help with the paper. The medical datasets used in this work can be download from the Volvis project web page. This work was supported in part by Grants from Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq # 202045/2012-9 ), Coordenação de Aperfeiçoamento de Pessoal de Nível Superior , (CAPES # 9864/11-3 ), the U.S. Department of Energy (DOE), Office of Biological and Environmental Research (BER), the National Science Foundation, and ExxonMobil.
PY - 2013
Y1 - 2013
N2 - Chernyaev's Marching Cubes 33 is one of the first algorithms intended to preserve the topology of the trilinear interpolant. In this work, we address three issues with the Marching Cubes 33 algorithm, two of which are related to its original description and one that is related to its variant. In particular, we solve a problem with the core disambiguation procedure of Marching Cubes 33 that prevents the extraction of topologically correct isosurfaces for the ambiguous configuration 13.5. This work closes an existing gap in the topological correctness of Marching Cubes 33. Furthermore, we make our results reproducible, meaning that examples provided in this work can be easily explored and studied. Finally, as part of the philosophy of reproducibility, we provide a corrected version of the Marching Cubes 33 open-source implementation and access to datasets that can be used to verify the correctness of any available topologically correct isosurface extraction implementation that preserves the topology of the trilinear interpolant.
AB - Chernyaev's Marching Cubes 33 is one of the first algorithms intended to preserve the topology of the trilinear interpolant. In this work, we address three issues with the Marching Cubes 33 algorithm, two of which are related to its original description and one that is related to its variant. In particular, we solve a problem with the core disambiguation procedure of Marching Cubes 33 that prevents the extraction of topologically correct isosurfaces for the ambiguous configuration 13.5. This work closes an existing gap in the topological correctness of Marching Cubes 33. Furthermore, we make our results reproducible, meaning that examples provided in this work can be easily explored and studied. Finally, as part of the philosophy of reproducibility, we provide a corrected version of the Marching Cubes 33 open-source implementation and access to datasets that can be used to verify the correctness of any available topologically correct isosurface extraction implementation that preserves the topology of the trilinear interpolant.
KW - Isosurface extraction
KW - Marching Cubes
KW - Topological guarantees
KW - Trilinear interpolation
UR - http://www.scopus.com/inward/record.url?scp=84880873604&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84880873604&partnerID=8YFLogxK
U2 - 10.1016/j.cag.2013.04.004
DO - 10.1016/j.cag.2013.04.004
M3 - Article
AN - SCOPUS:84880873604
SN - 0097-8493
VL - 37
SP - 840
EP - 850
JO - Computers and Graphics (Pergamon)
JF - Computers and Graphics (Pergamon)
IS - 7
ER -