【摘要】 针对从ICT(Industrial Computerized Tomography)切片图像中提取出的复杂轮廓数据的三维重建中数据量过多、算法复杂等问题,提出一种简单快速有效的三角网格拼接方法。即采用Freeman链码对断层图像的轮廓数据进行存储和精简,再根据相邻层间轮廓的相似性采用凸包理论来确定轮廓对应点,最后根据轮廓对应点情况对原有的轮廓点集合进行增补后采用最短对角法进行网格拼接。试验结果表明,该方法在保证重建精度的情况下有效减少数据量和计算消耗。更多还原

【Abstract】 Aimed at the problems of big data streams and algorithm complexity in 3-D triangular meshes generation of complicated contour data from ICT slicing images,a new algorithm is proposed. In this algorithm,the Freeman chain code is used to save and simplify contours points. Then the corresponding relation of the contour points is made sure by the theory of convex hull. Some new contour points are added in the lists of original contour points due to the corresponding relation of the contour points. At last, the triangular meshes are built though the theory of the shortest diagonal. The experimental results showed that the proposed algorithm is effective and accurate.更多还原