[1]Freeman H,Shapira R. Determining the minimum-area encasing rectangle for and arbitrary closed curve[J]. Comm. ACM,1975,18 (7):409-413. [2]Martin R R,Stephenson P C. Putting objects into boxes[J]. Comput. Aid. Des.,1988,20(9):506-514. [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(6):1433-1449. [4]颜建军,郑建荣,夏春明,等. 任意实体最小包容盒的确定[J]. 中国机械工程,2006,17(17):344-346.Yan J J,Zheng J R,Xia C M,et al. Determination of the minimum bounding box of an arbitrary solid[J]. China Mechanical Engineering,2006,17(17):344-346. [5]Donald R Chand,Sham S Kapur. An algorithm for convex polytopes[J]. Journal of the ACM,1970,17(1):78-86. [6]Preparata F P, Rivest R. An optimal real-time algorithm for planar convex hulls[J]. Communications of the Association for Computing Machinery,1979,22(7): 402-405. [7]Bradford Barber C,David P Dobkin,Hannu Huhdanpaa. The quickhull algorithm for convex hulls[J]. ACM Transactions on Mathematical Software,1996,22(4):469-483. [8]Tang M,Zhao J,Tong R,et al. GPU accelerated convex hull computation[J].Computers & Graphics,2012,36(5): 498-506. [9]毛鹏. 快速凸包计算实现及其应用[D]. 西安:西安电子科技大学,2013.Mao P. Fast Convexhull Computation Inplementation and Its Application[D]. Xi′an: Xidian University,2013. [10]Kim Y,Kim M,Elber G. Precise convex hull computation for freeform models using a hierarchical Gauss map and a Coons bounding volume hierarchy[J].Computer-Aided Design,2014,46: 252-257.
|