THREE-DIMENSIONAL RECONSTRUCTION BASED ON IMPROVED MARCHING CUBES ALGORITHM

Based on the standard Marching Cubes (MC) algorithm, this paper proposes an improved MC algorithm. First, the original 15 topological configurations in the MC algorithm are increased to 24, which effectively avoid the generation of voids phenomenon. To further improve the speed of three-dimensional (3D) reconstruction, in this paper, the midpoint selection method is used instead of the linear interpolation method, and the 24 configurations are divided into three types. Each class corresponds to a thread. The multi-thread parallel processing is used to improve the calculation speed. The critical region is used to realize multi-thread synchronization, and then we designed a protocol mapping table according to the idea of the message mapping table. The function pointer is triggered by macro. Processing function is called by function pointer and completes the encapsulation of the protocol mapping table, which maintains the opening and closing principle of the class and ensures the scalability of the class. Through the improved MC algorithm accuracy verification and reconstruction speed verification, it is concluded that the improved MC algorithm can make up for the voids problem. By comparing the calculation time under the two platforms of Windows and Linux, the reconstruction speed of the improved MC algorithm is approximately 30% faster than the standard MC algorithm and 40% faster than the Masala algorithm. Finally, the algorithm is applied to the medical image 3D reconstruction system, and the accuracy and applicability of the algorithm are demonstrated by two sets of examples.