Home
Editorial Committee
Brief Instruction
Back Issues
Instruction to Authors
Submission on line
Contact Us
Chinese

  The journal resolutely  resists all academic misconduct, once found, the paper will be withdrawn immediately.

Title:Fast calculation method of stamping die with non-standard forging stock size
Authors: Liu Hui Zhang Zhibing Liu Yuqi 
Unit: Huazhong University of Science & Technology 
KeyWords: stamping die  non-standard forging  stock size 
ClassificationCode:TG386
year,vol(issue):pagenumber:2015,40(6):6-9
Abstract:

In order to improve the calculation efficiency of non-standard forging stock size in stamping die design, a fast calculation method was proposed. The surface of 3D forging model was discreted into 3D lattice, and the minimum convex hull of the discrete lattice was calculated by QuickHull algorithm. On the basis of each convex hull surface, the sizes of 3D bounding box were calculated by projection and 2D convex hull algorithm, and then the minimum size could be obtained by comparison. The bounding box calculated by this algorithm was not the minimum bounding box of 3D forging model in theory, but calculation accuracy and efficiency could meet the stock requirement for the forging parts.

Funds:
材料成形与模具技术国家重点实验室资助项目(20131449)
AuthorIntro:
刘辉(1990-),男,硕士研究生。通讯作者:章志兵(1978-),男,博士,讲师。
Reference:


[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.

Service:
This site has not yet opened Download Service】【Add Favorite
Copyright Forging & Stamping Technology.All rights reserved
 Sponsored by: Beijing Research Institute of Mechanical and Electrical Technology; Society for Technology of Plasticity, CMES
Tel: +86-010-62920652 +86-010-82415085     Fax:+86-010-62920652
Address: No.18 Xueqing Road, Beijing 100083, P. R. China
 E-mail: fst@263.net    dyjsgg@163.com