Solution of minimum bounding box of scattered points based on genetic algorithm

[1] 章勤,黄琨,李光明.一种基于OBB的碰撞检测算法的改进[J].华中科技大学学报:自然科学版,2003,31(1):46-48 Zhang Qin,Huang Kun,Li Guangming.Improvement of collision-detection algorithm based on OBB[J].Journal of Huazhong University of Science and Technology:Natural Science Edition,2003,31(1):46-48(in Chinese) [2] Joseph O'Rouke.Finding minimal enclosing boxes[J].International Journal of Computer and Information Sciences,1985,14(3):183-199 [3] Chan C K,Tan S T.Determination of the minimum bounding box of an arbitrary solid:an iterative approach[J].Computers and Structures,2001,79(15):1433-1449 [4] 陈柏松,叶雪梅,安利.基于非线性主成分分析的最小包围盒计算方法[J].计算机集成制造系统,2010,16(11):2375-2378 Chen Baisong,Ye Xuemei,An Li.Minimum bounding box calculation based on nonlinear principle component analysis[J].Computer Integrated Manufacturing Systems,2010,16(11):2375-2378(in Chinese) [5] Dimitrov D,Knauer C,Kriegel K,et al.Bounds on the quality of the PCA bounding boxes[C]//Computational Geometry:Theory and Applications[D].Amsterdam:Elsevier,2009,42(8):772-789 [6] Vranic D V,Saupe D.3D model retrieval .Saxomy,Germany:University of Leipzig,2004 [7] Barber C B,Dobkin D P,Huhdanpaa H.The quickhull algorithm for convex hulls[C]//ACM Transactions on Mathematical Software.New York:ACM,1996,22(4):469-483 [8] Hamalainen T,Klapuri H,Saarinen J,et al.Accelerating genetic algorithm computation in tree shaped parallel computer[J].Systems Architecture,1996,42(1):19-36 [9] Chang Chunlin.A genetic algorithm for solving the two-dimensional assortment problem[J].Computers and Industrial Engineering,2006,50(1):175-184 [10] Wolpert D H,William G M.No free lunch theorems for optimization[J].IEEE Transaction on Evolutionary Computation,1997,1(1):67-82 [11] 王丰丰.求解动态优化问题的遗传算法的研究与实现[D].上海:上海交通大学,2010 Wang Fengfeng.Research and realization of the genetic algorithm for dynamic optimization problems[D].Shanghai:Shanghai Jiao Tong University,2010(in Chinese)