| 海量数据凸壳快速优化算法研究 |
| |
| 引用本文： | 张忠武,吴信才. 海量数据凸壳快速优化算法研究[J]. 微计算机信息, 2011, 0(8) |
| |
| 作者姓名： | 张忠武 吴信才 |
| |
| 作者单位： | 佳木斯大学信息电子技术学院;中国地质大学(武汉)信息工程学院; |
| |
| 基金项目： | 佳木斯大学科学技术研究项目(L2009-141);基金申请人:张忠武;项目名称:金字塔凸壳算法的研究与实现;基金颁发部门:佳木斯大学(L2009-141); 国家“863”计划基金资助项目(2003AA133010) |
| |
| 摘 要： | 分析描述加速凸壳算法的基本思想.在分析传统的加速凸壳算法的基础上,根据加速算法剔除内点的时机将加速算法分成静态加速算法和动态加算法.同时阐述了动态加速算法的应用条件,并将动态加速算法应于金字塔凸壳算法之中.通过大量实验数据对比说明动态加速算法对提高平面海量散乱点集的生成速度非常有效。
|
| 关 键 词： | 凸壳 点集 加速 边界 |
Research on Algorithm for Convex Hull Fast Optimization in Massive Data |
| |
| ZHANG Zhong-wu WU Xin-cai. Research on Algorithm for Convex Hull Fast Optimization in Massive Data[J]. Control & Automation, 2011, 0(8) |
| |
| Authors: | ZHANG Zhong-wu WU Xin-cai |
| |
| Affiliation: | ZHANG Zhong-wu WU Xin-cai(College of Information & Electronic Technology,Jiamusi University)(Faculty of Information Engineering,China University of Geosciences) |
| |
| Abstract: | This paper analyzes and describes the basic idea of accelerated convex hull algorithm.According to the timing of removing interior points,the accelerated algorithms are divided into two types of static and dynamic based on the analysis of traditional such algorithms.Simultaneously,the application conditions of dynamic accelerated algorithm are elaborated,and this idea is applied to pyramid convex hull algorithm.Through comparative analysis of large mounts of experimental data,to show that this algorithm can... |
| |
| Keywords: | convex hull point set acceleration border |
| 本文献已被 CNKI 等数据库收录！ |
