摘要：为了快速精确地进行加工区域边界抽取，给出了一种Z-map加工模型的加工区域边界抽取算法，该算法首先把Z-map模型下规则网格点阵转化为二元图进行边界抽取；然后以基于段长的方式，逐行扫描步长段，并利用上下行段之间的关系确定段左右节点的连接，以形成有向环，从而确定边界为外轮廓或为内轮廓，该算法时间复杂度为O（n），n为步长段的数量；接着通过对环中段间的连接关系分析，恢复了加工区域完整的边界信息；最后给出了该算法时间与段、行、列数之间的关系，同时与以前的算法进行了比较。结果表明,该算在效率和实施难度上都较以前算法有了一定的提高。

Abstract：For redusing the region boundary extraction algorithm complexity, in this study, Z-map model to binary image with value-range is transformed, then region problem is extracted from binary image. Via scanning Row and run, right and left node of run is connected by its relationship between Row，then the loop is constructed by foregoing connection and extract region boundary. According to the relationship of the run’s connection, resume the region boundary information is resumed completely. The time complexity of extraction algorithm is O(n), while n is the number of run. At last, the relation between the time consuming of the algorithm and the number of run, row and column were provided, while comparison of this arithmetic and before was also given.