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 条
  • [1] Efficient parameterization of large-scale dynamic models based on relative measurements
    Schmiester, Leonard
    Schaelte, Yannik
    Froehlich, Fabian
    Hasenauer, Jan
    Weindl, Daniel
    BIOINFORMATICS, 2020, 36 (02) : 594 - 602
  • [2] Large-scale curvature of networks
    Narayan, Onuttom
    Saniee, Iraj
    PHYSICAL REVIEW E, 2011, 84 (06)
  • [3] Curvature-based lipid partitioning and localization in a mitochondrial inner membrane model
    Golla, Vinaya Kumar
    Boyd, Kevin J.
    May, Eric R.
    BIOPHYSICAL JOURNAL, 2022, 121 (03) : 487A - 488A
  • [4] Alignment-Based Partitioning of Large-Scale Ontologies
    Hamdi, Faycal
    Safar, Brigitte
    Reynaud, Chantal
    Zargayouna, Haifa
    ADVANCES IN KNOWLEDGE DISCOVERY AND MANAGEMENT, 2010, 292 : 251 - +
  • [5] Efficient Large Scale Clustering based on Data Partitioning
    Bendechache, Malika
    Le-Khac, Nhien-An
    Kechadi, M-Tahar
    PROCEEDINGS OF 3RD IEEE/ACM INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS, (DSAA 2016), 2016, : 612 - 621
  • [6] Lavender: An Efficient Resource Partitioning Framework for Large-Scale Job Colocation
    Peng, Wangqi
    Li, Yusen
    Li, Xiaoguang
    Wang, Gang
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2024, 21 (03)
  • [7] A Framework for Efficient Matching of Large-Scale Metadata Models
    Moawed, Seham
    Algergawy, Alsayed
    Sarhan, Amany
    Eldosouky, Ali
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2019, 44 (04) : 3117 - 3135
  • [8] A Framework for Efficient Matching of Large-Scale Metadata Models
    Seham Moawed
    Alsayed Algergawy
    Amany Sarhan
    Ali Eldosouky
    Arabian Journal for Science and Engineering, 2019, 44 : 3117 - 3135
  • [9] On Efficient Training of Large-Scale Deep Learning Models
    Shen, Li
    Sun, Yan
    Yu, Zhiyuan
    Ding, Liang
    Tian, Xinmei
    Tao, Dacheng
    ACM COMPUTING SURVEYS, 2025, 57 (03)
  • [10] GUIDELINES FOR PARTITIONING IN LARGE-SCALE INTEGRATION
    IMAI, JK
    DEATLEY, ER
    ELECTRO-TECHNOLOGY, 1967, 80 (02): : 50 - &