首页 | 本学科首页   官方微博 | 高级检索  
     

基于顶点间距离性质的凸多边形直径算法
引用本文:蒋联源. 基于顶点间距离性质的凸多边形直径算法[J]. 计算机工程与设计, 2008, 29(21)
作者姓名:蒋联源
作者单位:广西工学院计算机工程系,广西柳州,545006
摘    要:平面点集的直径问题在计算机图形学、模式识别、图像处理、cAD,CAM等众多领域中均有广泛应用,该问题可转化为求凸多边形直径问题.研究得出了凸多边形顶点间距离关系的4条性质,利用这些性质提出一种基于顶点间距离性质的凸多边形直径算法.理论分析和实验结果表明,该算法计算速度快、存储效率高,实用性较强.

关 键 词:凸多边形  直径  夹角符号序列  夹角序列  性质

Algorithm of convex polygon diameter based on properties of convex polygon vertices distance
JIANG Lian-yuan. Algorithm of convex polygon diameter based on properties of convex polygon vertices distance[J]. Computer Engineering and Design, 2008, 29(21)
Authors:JIANG Lian-yuan
Affiliation:JIANG Lian-yuan(Department of Computer Engineering,Guangxi University of Technology,Liuzhou 545006,China)
Abstract:Diameter problem of points in the plane has numerous applications in computer graphics,pattern recognition,image processing,CAD/CAM and so on.It can be transformed to a diameter problem of convex polygon.Four properties about distance relation of convex polygon vertices are concluded,and an algorithm for calculating diameter of convex polygon based on properties of vertices distance is presented.Theoretical analysis and experimental results indicate that the algorithm is efficient and practicable.
Keywords:convex polygon  diameter  angle sign sequence  angle sequence  property  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号