摘要
A new method for solving the tiling problem of surface reconstruction is proposed. The proposed method uses a snake algorithm to segment the original images, the contours are then transformed into strings by Freeman＇ s code. Symbolic string matching technique is applied to establish a correspondence between the two consecutive contours. The surface is composed of the pieces reconstructed from the correspondence points. Experimental results show that the proposed method exhibits a good behavior for the quality of surface reconstruction and its time complexity is proportional to mn where m and n are the numbers of vertices of the two consecutive slices, respectively.
利用链码理论对已获取的层间轮廓线进行编码,将二维的轮廓曲线转化为包含轮廓形状信息的一维链码;以包含轮廓形状相似信息的“链间距离”为目标函数,采用链码匹配技术完成相邻层轮廓特征点的匹配,将复杂轮廓线分割为若干简单的曲线段,重构的曲面由这些分片构造的三角片曲面拼接而成.实验表明该算法能够找出复杂轮廓线上恰当的对应特征点,从而构造出较真实的曲面.
