摘要
对求解直线段树状结构的凸多边形中轴算法研究,其基本思想是求凸多边形内到至少2条边或3条边等距离的点的轨迹.算法获得的凸多边形中轴更有利于应用,但其控制实现比较难理解.对该算法部分实现过程和不足之处进行优化,并采用".NET"技术实现了该算法.讨论了权重边对多边形中轴的影响.
This paper studies the straight tree structure of convex polygon medial axis algorithms. Its main idea is to calculate and recode the locus of the equal-distance points to two or more edges of the convex polygon. Algorithm convex polygon medial axis is more advantageous for application. But the calculation process is difficult to understand and realize. This paper optimizes the process the disadvantages of the algorithm and realizes this algorithm by. Net program design platform. The effects of weight-edges of polygon on the polygon medial axis are discussed.
出处
《重庆工学院学报（自然科学版）》
2009年第9期176-180,共5页
Journal of Chongqing Institute of Technology
关键词
凸多边形
中轴
优化
加权边
convex polygon
medial axis
optimize
weight-edge
