一种基于分裂合并的多边形逼近算法  

Polygon Approximation Algorithm Based on the Split and Merge

作　　者：郝园[1] 黄雪梅[1] 张磊安[1] 王金川[1] 

机构地区：[1]山东理工大学机械工程学院,山东淄博255049

出　　处：《机械设计与制造》2013年第6期200-202,共3页Machinery Design & Manufacture

基　　金：山东省中青年科学家奖励基金(BS2009ZZ017)

摘　　要：断层医学图象目标组织经图象分割、轮廓跟踪后得到的轮廓像素点数据量较大,不宜直接用于几何建模。多边形逼近是提取曲线特征点和简化数据、加快图形运算的一个重要方法,提出一种基于分裂合并的多边形逼近算法,将轮廓像素点集合分段进行线段逼近,逐次递增进行共线检查,反复执行分裂、合并操作,直到所有逼近误差在指定范围内,逼近多边形不再改变为止。该算法能够在保持原始轮廓形状特征的前提下,有效减少数据量,提高了计算效率。The outline pixels of sectional medical image goal organization are not appropriate to be directly used in the geometric modeling,for it is with large amount of data after image segmentation,contour following.Polygon approximation is an important method in feature points extration and data reducing.In general,it presents a new polygonal approximation approach based on the fission and fusion,it will segment the outline pixel for line approximation and check collinear successive increase,fission and fusion,until all the approximate error in the designated area and approaching polygonal is no longer changed.The method can reduce the quantity of data effectively without changing the original profile,and greatly increase the computation efficiency.

关 键 词：断层医学图象 轮廓跟踪 多边形逼近 共线检查 

分 类 号：TH16[机械工程—机械制造及自动化]