首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于遗传算法的散乱点云最小包围盒求解
引用本文:孙殿柱,史阳,刘华东,李延瑞.基于遗传算法的散乱点云最小包围盒求解[J].北京航空航天大学学报,2013,39(8):995-998.
作者姓名:孙殿柱  史阳  刘华东  李延瑞
作者单位:山东理工大学机械工程学院,淄博,255091;山东理工大学机械工程学院,淄博,255091;山东理工大学机械工程学院,淄博,255091;山东理工大学机械工程学院,淄博,255091
基金项目:国家自然科学基金资助项目(51075247);山东省自然科学基金资助项目(ZR2010EM008)
摘    要:提出一种将遗传算法和O’Rourke算法相融合的最小包围盒求解算法,以O’Rourke算法中的体积函数作为遗传算法的目标函数,采用遗传算子指导解的搜索方向,通过新种群的迭代生成过程缩小搜索区域与体积误差,种群迭代结束后对最优个体解码获得最小包围盒.实验结果表明,该算法可在满足最小包围盒体积精度的同时显著提高算法的运行效率,能够有效处理各种复杂散乱点云数据的最小包围盒快速求解问题.

关 键 词:散乱点云  最小包围盒  遗传算法  体积函数
收稿时间:2012-08-16

Solution of minimum bounding box of scattered points based on genetic algorithm
Sun Dianzhu;Shi Yang;Liu Huadong;Li Yanrui.Solution of minimum bounding box of scattered points based on genetic algorithm[J].Journal of Beijing University of Aeronautics and Astronautics,2013,39(8):995-998.
Authors:Sun Dianzhu;Shi Yang;Liu Huadong;Li Yanrui
Institution:School of Mechanical Engineering, Shandong University of Technology, Zibo 255091, China
Abstract:An algorithm of minimum bounding box combining genetic algorithm with O'Rourke's algorithm was proposed, which regarded the volume function in O'Rourke's algorithm as the objective function and used the evolutionary factors to guide the searching directions. Through the process of the population's iterative generation, this algorithm narrowed the search area and the volume error. When the iterative process was over, the minimum bounding box was obtained by decoding the optimal individuals. The experimental results show that the algorithm can improve algorithmic efficiency and satisfy the volume accuracy simultaneously. The algorithm can deal with sorts of problems related to minimum bounding box fast solving of complex scattered point cloud.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京航空航天大学学报》浏览原始摘要信息
点击此处可从《北京航空航天大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号