欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出一种计算平面点集凸壳的快速算法。利用极值点划分出四个矩形,它们包含了所有凸壳顶点,通过对矩形中的点进行扫描,排除明显不是凸壳顶点的点,剩余的点构成一个简单多边形。再利用极点顺序法判断多边形顶点的凹凸性并删除所出现的凹顶点,最终得到一个凸多边形即为点集的凸壳。整个算法简洁明了,避免了乘法运算（除最坏情况外）,从而节省计算时间。
英文摘要：
An efficient algorithm for computing the convex hull of plane point set is proposed.Firstly,according to the extremity point of the point set,the point on the convex hull is restricted in four rectangles.By scanning the point in rectangles the point which is in evidence not on the convex hull is eliminated,and remain points can constitute a simple polygon.Then,the convexityconcavity of polygon＇s vertex is recognized by the vertices sequence and all concavity vertexes are deleted.Lastly,a convex polygon is obtained and it is just the convex hull of the point set.Test results show the high efficiency and stability of this terse algorithm.
同期刊论文项目
同项目期刊论文
期刊信息
位置：