对现有的Marching Cubes改进算法从拓扑结构二义性、提高逼近精度、算法的时间和空间效率3个方面进行综述,对每一类改进算法进行新的分类,并对各类算法的实验结果进行比较.
We review the Marching Cubes algorithms and discuss its recent advances at the aspects of topology, accuracy, time and space complexity. New classifications of these improvement methods are proposed and their results are compared.