摘要
文章提出了一种平面散乱点集边界拟合算法,算法的基本思想是利用一种技巧对凸壳顶点进行筛选,使边界点迅速被找到,进而对其进行拟合。该算法能使用较少内存空间拟合平面散乱点集边界。设计了相应的vc程序验证了此算法。
An fitting boundary algorithm for a set of discrete points in a plane is proposed in this paper. The basic idea of the algorithm is that vertices of the convex hull are selected by using a technique so that the points of the boundary are found quickly, then the boundary is fitted. This algorithm can cost few memory space for fitting the boundary. An vc program is designed to prove the correction of the algorithm.
出处
《重庆职业技术学院学报》
2006年第5期162-163,共2页
Journal of Chongqing Vocational& Technical Institute
