检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南财经大学信息技术应用研究所,成都610074 [2]西南财经大学经济信息工程学院,成都610074
出 处:《计算机科学》2008年第2期235-237,262,共4页Computer Science
摘 要:本文依据同构化凸壳构造基本定理,提出效率更高的双域双向水平倾角最小化圈绕凸壳新算法。本新算法的同构化特点是:1)"初始顶点与双域生成"处理:找出给定二维点集S的最低点和最高点,即Y轴坐标值最小点(若有多个最小点,则只取最左的最小点)和Y轴坐标值最大点(若有多个最大点,则只取最左的最大点),作为凸壳(逆时针圈绕的)A向初始顶点、(顺时针圈绕的)B向初始顶点;并以这两个初始顶点为端点的线段,把原二维点集划分为两个独立的子点集S右、S左。2)在S右内,进行双向"圈绕寻找下一新顶点"即凸壳A向、B向最新顶点寻找处理:分别过自己的最近新顶点,作X轴正向射线,并A向或B向找出当前点集内对该顶点正向射线(为始边的)倾角最小的点;删除对已得各顶点所构成的子凸壳内点,当所剩当前点集非空时继续作"2)"逐边圈绕,直到为空。3)同理,在子点集S左内,进行双向"圈绕寻找下一新顶点"即凸壳A向、B向最新顶点寻找处理。According to the isomorphic fundamental theorem of the convex hull construction, a more efficient new algorithm to find a convex hull based on coiling with a minimum lever pitch in double domain and double direction is advanced. This new algorithm isomorphism characteristic is: 1)"The generation of initial vertex and double domain": find out the bottommost point and the highest point on the convex hull S as the initial vertex of the convex hull, which has the minimum or the maximum coordinate value of the Y axis among all the points in given 2D point set (if the bottommost point is not only one, the bottommost and leftmost or the highest rightmost point should be selected). The line which take the two initial vertexes as end points divide the 2D point set into two absolute point set Sright Sllef,. 2)In the 2D point set Sright do the process of seeking the newest apex with double direction: passing the last new regressive vertex,make the vertex's half line paralleled by X axis along positive direction, and find out the current vertexes with a minimum pitch to its vertex's regressive half line(as the initial line) to be the newest vertex in coiling; Delete the subconvex hull's inner points. And loop from"2)"to coil with double direction side by side continuingly while the reminded point set is not empty. 3)in the 2D point set Slat do the similar process.
关 键 词:同构化 凸壳算法 顶点射线 水平倾角 双域双向圈绕
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构] TN791.02[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15