{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:20:30Z","timestamp":1760239230592,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>A triangular mesh obtained by scanning 3D models typically contains holes. We present an effective technique for filling a hole in a triangular mesh in geometric modeling. Simple triangulation of a hole is refined and remeshed iteratively to generate an initial patch. The generated patch is then enhanced to become a target patch by minimizing the variation of principal curvatures. In discrete approximation, this produces a third-order Laplacian system of sparse symmetric positive definite matrix, and the symmetry can efficiently be used to find the robust solutions to the given Laplacian system. Laplacian smoothing of the target patch is defined as a source patch. The shape difference between two corresponding vertices of the source and the target patches is measured in terms of Euclidean distance and curvature variation. On the basis of the shape difference and a user-specified control parameter, different blending weights are determined for each vertex, and the final patch is generated by blending two patches. We demonstrate the effectiveness of our technique by discussing several examples. The experimental results show that our technique can effectively restore salient geometric features of the original shape.<\/jats:p>","DOI":"10.3390\/sym12111759","type":"journal-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T08:59:28Z","timestamp":1603443568000},"page":"1759","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parametric Blending of Hole Patches Based on Shape Difference"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6708-6692","authenticated-orcid":false,"given":"Jung-Ho","family":"Park","sequence":"first","affiliation":[{"name":"Department of Multimedia Engineering, Dongguk University, Seoul 04620, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5383-7005","authenticated-orcid":false,"given":"Sanghun","family":"Park","sequence":"additional","affiliation":[{"name":"Department of Multimedia, Dongguk University, Seoul 04620, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0015-8305","authenticated-orcid":false,"given":"Seung-Hyun","family":"Yoon","sequence":"additional","affiliation":[{"name":"Department of Multimedia Engineering, Dongguk University, Seoul 04620, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Branch, J., Prieto, F., and Boulanger, P. (2006, January 17\u201320). A hole-filling algorithm for triangular meshes using local radial basis function. Proceedings of the 15th International Meshing Roundtable, Birmingham, AL, USA.","DOI":"10.1109\/3DPVT.2006.33"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0167-8396(94)00011-G","article-title":"Filling gaps in the boundary of a polyhedron","volume":"12","author":"Barequet","year":"1995","journal-title":"Comput. Aided Geom. Des."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Botsch, M., Kobbelt, L., Pauly, M., Alliez, P., and L\u00e9vy, B. (2010). Polygon Mesh Processing, CRC Press.","DOI":"10.1201\/b10688"},{"key":"ref_4","unstructured":"Liepa, P. (, January June). Filling holes in meshes. Proceedings of the 2003 Eurographics\/ACM SIGGRAPH Symposium on Geometry Processing, Aachen, Germany."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1007\/s00371-010-0416-3","article-title":"A lightweight approach to repairing digitized polygon meshes","volume":"26","author":"Attene","year":"2010","journal-title":"Vis. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Wei, M., Wu, J., and Pang, M. (2010, January 23\u201324). An integrated approach to filling holes in meshes. Proceedings of the 2010 International Conference on Artificial Intelligence and Computational Intelligence, Sanya, China.","DOI":"10.1109\/AICI.2010.302"},{"key":"ref_7","unstructured":"Pfeifle, R., and Seidel, H.P. (1996, January 22\u201324). Triangular B-splines for blending and filling of polygonal holes. Proceedings of the Conference on Graphics Interface\u201996, Toronto, ON, Canada."},{"key":"ref_8","unstructured":"Chen, C.Y., Cheng, K.Y., and Liao, H.M. (2005). A sharpness dependent approach to 3D polygon mesh hole filling. EG Short Presentations, The Eurographics Association."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1109\/TVCG.2007.70625","article-title":"A sharpness-dependent filter for recovering sharp features in repaired 3D mesh models","volume":"14","author":"Chen","year":"2008","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_10","unstructured":"Chen, C., Cheng, K., and Liao, H.M. (2004, January 2\u20136). Fairing of polygon meshes via Bayesian discriminant analysis. Proceedings of the 12-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision\u20192004, WSCG 2004, Plzen-Bory, Czech Republic."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.cagd.2005.04.003","article-title":"A sharpness dependent filter for mesh smoothing","volume":"22","author":"Chen","year":"2005","journal-title":"Comput. Aided Geom. Des."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.cag.2011.12.007","article-title":"Automatic hole-filling of CAD models with feature-preserving","volume":"36","author":"Wang","year":"2012","journal-title":"Comput. Graph."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhao, W., Gao, S., and Lin, H. (2007, January 15\u201318). A robust hole-filling algorithm for triangular mesh. Proceedings of the 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics, Beijing, China.","DOI":"10.1109\/CADCG.2007.4407836"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3605","DOI":"10.1002\/nme.1620372103","article-title":"The advancing-front mesh generation method revisited","volume":"37","author":"George","year":"1994","journal-title":"Int. J. Numer. Methods Eng."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Yu, Y., Zhou, K., Xu, D., Shi, X., Bao, H., Guo, B., and Shum, H.Y. (2004). Mesh editing with Poisson-based gradient field manipulation. ACM SIGGRAPH 2004 Papers, Association for Computing Machinery. SIGGRAPH \u201904.","DOI":"10.1145\/1186562.1015774"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1016\/j.cag.2006.08.020","article-title":"Filling holes in meshes using a mechanical model to simulate the curvature variation minimization","volume":"30","author":"Pernot","year":"2006","journal-title":"Comput. Graph."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"889","DOI":"10.3722\/cadaps.2008.889-899","article-title":"An automatic hole-filling algorithm for polygon meshes","volume":"5","author":"Wu","year":"2008","journal-title":"Comput. Aided Des. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0167-8396(00)00005-4","article-title":"Filling polygonal holes using C1 cubic triangular spline patches","volume":"17","author":"Chui","year":"2000","journal-title":"Comput. Aided Geom. Des."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.cad.2009.12.006","article-title":"Polynomial blending in a mesh hole-filling application","volume":"42","author":"Li","year":"2010","journal-title":"Comput. Aided Des."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.matcom.2018.12.012","article-title":"Filling holes using a mesh of filled curves","volume":"164","author":"Fortes","year":"2019","journal-title":"Math. Comput. Simul."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0925-7721(99)00007-3","article-title":"Using generic programming for designing a data structure for polyhedral surfaces","volume":"13","author":"Kettner","year":"1999","journal-title":"Comput. Geom."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1115\/1.1631021","article-title":"Dynamic remeshing and applications","volume":"3","author":"Vorsatz","year":"2003","journal-title":"J. Comput. Inf. Sci. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Botsch, M., and Kobbelt, L. (, January July). A remeshing approach to multiresolution modeling. Proceedings of the 2004 Eurographics\/ACM SIGGRAPH Symposium on Geometry Processing, New York, NY, USA.","DOI":"10.1145\/1057432.1057457"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1145\/142920.134035","article-title":"Functional optimization for fair surface design","volume":"26","author":"Moreton","year":"1992","journal-title":"ACM Siggraph Comput. Graph."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0010-4485(90)90049-I","article-title":"Using partial differential equations to generate free-form surfaces","volume":"22","author":"Bloor","year":"1990","journal-title":"Comput. Aided Des."},{"key":"ref_26","first-page":"103","article-title":"Stepwise regression: An application in earthquake localization","volume":"7","author":"Pucciarelli","year":"2018","journal-title":"J. Environ. Sci. Eng. B"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Meyer, M., Desbrun, M., Schr\u00f6der, P., and Barr, A.H. (2003). Discrete differential-geometry operators for triangulated 2-manifolds. Visualization and mathematics III, Springer.","DOI":"10.1007\/978-3-662-05105-4_2"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Desbrun, M., Meyer, M., Schr\u00f6der, P., and Barr, A.H. (1999, January 8\u201313). Implicit fairing of irregular meshes using diffusion and curvature flow. Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA.","DOI":"10.1145\/311535.311576"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/11\/1759\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:26:51Z","timestamp":1760178411000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/11\/1759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,23]]},"references-count":28,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2020,11]]}},"alternative-id":["sym12111759"],"URL":"https:\/\/doi.org\/10.3390\/sym12111759","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2020,10,23]]}}}