{"title":"Adaptive gap closing for complex triangular mesh repair using geometric and topological characteristics","authors":"Shuwei Shen , Shuai Zhou , Zhoufang Xiao , Jingchen Gao , Chenhao Xu","doi":"10.1016/j.cad.2025.103981","DOIUrl":null,"url":null,"abstract":"<div><div>Gaps are prevalent defects in triangular meshes, often arising from various sources such as surface scanning and CAD model generation. Despite their significance, the automatic repair of complex gaps has received limited attention compared to other mesh imperfections. This study presents a novel surface-based gap-closing method for triangular mesh repair, leveraging both local geometric and topological characteristics to robustly match and merge gap boundaries. The proposed approach first employs a global–local vertex merging procedure with adaptive tolerances to eliminate duplicate vertices and simplify complex gaps. Subsequently, gaps are identified and classified into connected and disconnected types based on their topological and geometric features. For each detected gap, a non-iterative closing procedure is applied, simultaneously matching and merging all boundary vertices. An adaptive scheme is introduced to determine the geometric tolerance for vertex matching, ensuring the effective preservation of the original geometric shape. Extensive numerical experiments on a large dataset of discrete models demonstrate the effectiveness and robustness of the proposed method in closing both connected and disconnected gaps.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"190 ","pages":"Article 103981"},"PeriodicalIF":3.1000,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448525001423","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
Gaps are prevalent defects in triangular meshes, often arising from various sources such as surface scanning and CAD model generation. Despite their significance, the automatic repair of complex gaps has received limited attention compared to other mesh imperfections. This study presents a novel surface-based gap-closing method for triangular mesh repair, leveraging both local geometric and topological characteristics to robustly match and merge gap boundaries. The proposed approach first employs a global–local vertex merging procedure with adaptive tolerances to eliminate duplicate vertices and simplify complex gaps. Subsequently, gaps are identified and classified into connected and disconnected types based on their topological and geometric features. For each detected gap, a non-iterative closing procedure is applied, simultaneously matching and merging all boundary vertices. An adaptive scheme is introduced to determine the geometric tolerance for vertex matching, ensuring the effective preservation of the original geometric shape. Extensive numerical experiments on a large dataset of discrete models demonstrate the effectiveness and robustness of the proposed method in closing both connected and disconnected gaps.
期刊介绍:
Computer-Aided Design is a leading international journal that provides academia and industry with key papers on research and developments in the application of computers to design.
Computer-Aided Design invites papers reporting new research, as well as novel or particularly significant applications, within a wide range of topics, spanning all stages of design process from concept creation to manufacture and beyond.