An efficient curvature-based partitioning of large-scale STL models

被引:50
作者
Hao, Jingbin [1 ]
Fang, Liang [2 ]
Williams, Robert E. [3 ]
机构
[1] China Univ Min & Technol, Coll Mech & Elect Engn, Xuzhou, Peoples R China
[2] China Univ Min & Technol, Dept Mech Engn & Automat, Xuzhou, Peoples R China
[3] Univ Nebraska, Dept Ind & Management Syst Engn, Lincoln, NE 68588 USA
关键词
Rapid prototypes; Manufacturing systems; Modelling; CONVEX DECOMPOSITION; ALGORITHMS; POLYHEDRA;
D O I
10.1108/13552541111113862
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
Purpose - Rapid prototyping (RP) of large-scale solid models requires the stereolithographic (STL) file to be precisely partitioned. Especially, the selection of cutting positions is critical for the fabrication and assembly of sub-models. The purpose of this paper is to present an efficient curvature-based partitioning for selecting the best-fit loop and decomposing the large complex model into smaller and simpler sub-models with similar-shaped joints, which facilitate the final assembly. Design/methodology/approach - The partition algorithm is benefited from curvature analysis of the model surface, including extracting the feature edges and constructing the feature loops. The efficiency enhancement is achieved by selecting the best-fit loop and constructing the similar-shape joints. The utility of the algorithm is demonstrated by the fabrication of large-scale rapid prototypes. Findings - By using the proposed curvature-based partition algorithm, the reasonability and efficiency of STL model partition can be greatly improved, and the complexity of sub-models has been reduced. It is found that the large-scale model is efficiently partitioned and the sub-models are precisely assembled using the proposed partitioning. Originality/value - The curvature-based partition algorithm is used in the RP field for the first time. Based on the curvature-based partitioning, the reasonability and efficiency of large-scale RP is addressed in this paper.
引用
收藏
页码:116 / 127
页数:12
相关论文
共 25 条
[1]  
[Anonymous], P 20 ANN S COMP GEOM
[2]  
[Anonymous], 2001, SI3D '01
[3]   CONVEX DECOMPOSITION OF POLYHEDRA AND ROBUSTNESS [J].
BAJAJ, CL ;
DEY, TK .
SIAM JOURNAL ON COMPUTING, 1992, 21 (02) :339-364
[4]   RECOGNITION-BY-COMPONENTS - A THEORY OF HUMAN IMAGE UNDERSTANDING [J].
BIEDERMAN, I .
PSYCHOLOGICAL REVIEW, 1987, 94 (02) :115-147
[5]   Strategies for polyhedral surface decomposition: An experimental study [J].
Chazelle, B ;
Dobkin, DP ;
Shouraboura, N ;
Tal, A .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (5-6) :327-342
[6]  
Chazelle B., 1992, SWAT 92, P364
[7]  
CHEN Y, 2007, ASME INT DES ENG TEC
[8]  
CHEN Y, 2004, J HUAZHONG U SCI TEC, V32, P61
[9]   Automated generation of assembly features in layered manufacturing [J].
Delebecque, Benoit ;
Houtmann, Yves ;
Lauvaux, Geoffroy ;
Barlier, Claude .
RAPID PROTOTYPING JOURNAL, 2008, 14 (04) :234-245
[10]   A Hybrid Approach to Surface Segmentation of Sparse Triangle Meshes [J].
Dong, Fangmin ;
Zhang, Rui ;
Liu, Yong .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, 2008, :669-674