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

被引:48
|
作者
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
相关论文
共 50 条
  • [21] A Distributed Algorithm for Large-Scale Graph Partitioning
    Rahimian, Fatemeh
    Payberah, Amir H.
    Girdzijauskas, Sarunas
    Jelasity, Mark
    Haridi, Seif
    ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS, 2015, 10 (02)
  • [22] Adaptive Partitioning of Large-Scale Dynamic Graphs
    Vaquero, Luis M.
    Cuadrado, Felix
    Logothetis, Dionysios
    Martella, Claudio
    2014 IEEE 34TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2014), 2014, : 144 - 153
  • [23] An Efficient Numerical Method for Mean Curvature-Based Image Registration Model
    Zhang, Jin
    Chen, Ke
    Chen, Fang
    Yu, Bo
    EAST ASIAN JOURNAL ON APPLIED MATHEMATICS, 2017, 7 (01) : 125 - 142
  • [24] Divide and Conquer: Efficient Large-Scale Structure from Motion Using Graph Partitioning
    Bhowmick, Brojeshwar
    Patra, Suvam
    Chatterjee, Avishek
    Govindu, Venu Madhav
    Banerjee, Subhashis
    COMPUTER VISION - ACCV 2014, PT II, 2015, 9004 : 273 - 287
  • [25] Nieme: Large-scale energy-based models
    Maes, Francis
    Journal of Machine Learning Research, 2009, 10 : 743 - 746
  • [26] Simulation of large-scale rule-based models
    Colvin, Joshua
    Monine, Michael I.
    Faeder, James R.
    Hlavacek, William S.
    Von Hoff, Daniel D.
    Posner, Richard G.
    BIOINFORMATICS, 2009, 25 (07) : 910 - 917
  • [27] Nieme: Large-Scale Energy-Based Models
    Maes, Francis
    JOURNAL OF MACHINE LEARNING RESEARCH, 2009, 10 : 743 - 746
  • [28] REQUIEM FOR LARGE-SCALE MODELS
    LEE, DB
    JOURNAL OF THE AMERICAN INSTITUTE OF PLANNERS, 1973, 39 (03): : 163 - 178
  • [29] MODELS OF LARGE-SCALE STRUCTURE
    FRENK, CS
    PHYSICA SCRIPTA, 1991, T36 : 70 - 87
  • [30] An efficient approach for large scale graph partitioning
    Renzo Zamprogno
    André R. S. Amaral
    Journal of Combinatorial Optimization, 2007, 13