| 引用本文： |
-
张显全,刘丽娜,唐振军.一种凸多边形直径算法[J].广西科学院学报,2005,(4):199-201. [点击复制]
- Zhang Xianquan,Liu Lina,Tang Zhenjun.An Algorithm for Calculating Diameter of Convex Polygon[J].Journal of Guangxi Academy of Sciences,2005,(4):199-201. [点击复制]
|
|
| 摘要: |
| 在研究凸多边形性质的基础上,构建一种新的凸多边形直径算法。该算法首先计算凸多边形顶点x坐标、y坐标的极值点,然后通过极值点将凸多边形分为几个区域,最后计算这些不同区域中顶点的距离可得凸多边形的直径。该算法简单,运行效率高。 |
| 关键词: 凸多边形 区域 直径 计算几何 |
| DOI： |
| 投稿时间：2005-06-29 |
| 基金项目:广西自然科学基金(No.0447035)资助项目。 |
|
| An Algorithm for Calculating Diameter of Convex Polygon |
|
Zhang Xianquan, Liu Lina, Tang Zhenjun
|
| (Dept. of Comp. Sci., Guangxi Normal Univ., Guilin, Guangxi, 541004, China) |
| Abstract: |
| The properties of the convex polygon are discussed and a algorithm for the diameter of convex polygon based on its properties is proposed.In the algorithm,the extremum points at the x and y coordinates are calculated,and the convex polygon is divided into several regions by the extremum points.The diameter of convex polygon is obtained by computing of the distances of vertexes in different regions.The present algorithm is simple,effective and applicable. |
| Key words: convex polygon region diameter computation geometry |
