{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:05:58Z","timestamp":1768716358848,"version":"3.49.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272429"],"award-info":[{"award-number":["62272429"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62025207"],"award-info":[{"award-number":["62025207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2022YFB3303400"],"award-info":[{"award-number":["2022YFB3303400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Major Project of Science and Technology of Anhui Province","award":["202203a05020050"],"award-info":[{"award-number":["202203a05020050"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p>We propose a novel method to compute high-quality piecewise developable approximations for triangular meshes. Central to our approach is an evolutionary genetic algorithm for optimizing the combinatorial and discontinuous fitness function, including the approximation error, the number of patches, the patch boundary length, and the penalty for small patches and narrow regions within patches. The genetic algorithm's operations (i.e., initialization, selection, mutation, and crossover) are explicitly designed to minimize the fitness function.<\/jats:p>\n          <jats:p>The main challenge is evaluating the fitness function's approximation error as it requires developable patches, which are difficult or time-consuming to obtain. Resolving the challenge is based on a critical observation: the approximation error and the mapping distortion between an input surface and its developable approximation are positively correlated empirically. To efficiently measure distortion without explicitly generating developable shapes, we creatively use conformal mapping techniques. Then, we control the mapping distortion at a relatively low level to achieve high shape similarity in the genetic algorithm.<\/jats:p>\n          <jats:p>The feasibility and effectiveness of our method are demonstrated over 240 complex examples. Compared with the state-of-the-art methods, our results have much smaller approximation errors, fewer patches, shorter patch boundaries, and fewer small patches and narrow regions.<\/jats:p>","DOI":"10.1145\/3592140","type":"journal-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T14:29:21Z","timestamp":1690381761000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Evolutionary Piecewise Developable Approximations"],"prefix":"10.1145","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-5518","authenticated-orcid":false,"given":"Zheng-Yu","family":"Zhao","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3166-4136","authenticated-orcid":false,"given":"Mo","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1924-0421","authenticated-orcid":false,"given":"Zheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7934-6060","authenticated-orcid":false,"given":"Qing","family":"Fang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4352-1431","authenticated-orcid":false,"given":"Ligang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8479-0107","authenticated-orcid":false,"given":"Xiao-Ming","family":"Fu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]}],"member":"320","published-online":{"date-parts":[[2023,7,26]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Olivier Devillers, and Martin Isenburg.","author":"Alliez Pierre","year":"2003","unstructured":"Pierre Alliez, Eric Colin De Verdire, Olivier Devillers, and Martin Isenburg. 2003. Isotropic surface remeshing. In 2003 Shape Modeling International. IEEE, 49--58."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01142.x"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13327"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14374"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01059.x"},{"key":"e_1_2_2_6_1","volume-title":"Polygon mesh processing","author":"Botsch Mario","unstructured":"Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, and Bruno L\u00e9vy. 2010. Polygon mesh processing. CRC press."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015817"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00580"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14649"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392447"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3478513.3480526","article-title":"Computing sparse cones with bounded distortion for conformal parameterizations","volume":"40","author":"Fang Qing","year":"2021","unstructured":"Qing Fang, Wenqing Ouyang, Mo Li, Ligang Liu, and Xiao-Ming Fu. 2021. Computing sparse cones with bounded distortion for conformal parameterizations. ACM Trans. Graph. 40, 6 (2021), 1--9.","journal-title":"ACM Trans. Graph."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2020.102863"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/846276.846284"},{"key":"e_1_2_2_14_1","unstructured":"Ga\u00ebl Guennebaud Beno\u00eet Jacob et al. 2010. Eigen v3. http:\/\/eigen.tuxfamily.org."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417835"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392430"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2005.00883.x"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138450.1138461"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360674"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925944"},{"key":"e_1_2_2_21_1","volume-title":"A fast algorithm for Steiner trees. Acta informatica 15, 2","author":"Kou L","year":"1981","unstructured":"L Kou, George Markowsky, and Leonard Berman. 1981. A fast algorithm for Steiner trees. Acta informatica 15, 2 (1981), 141--145."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566590"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3528223.3530118"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201328"},{"key":"e_1_2_2_25_1","volume-title":"Geometric Modeling with Conical Meshes and Developable Surfaces. In ACM SIGGRAPH 2006 Papers. 681--689","author":"Liu Yang","year":"2006","unstructured":"Yang Liu, Helmut Pottmann, Johannes Wallner, Yong-Liang Yang, and Wenping Wang. 2006. Geometric Modeling with Conical Meshes and Developable Surfaces. In ACM SIGGRAPH 2006 Papers. 681--689."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/PG.2007.16"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015711"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185605"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2462010"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180494"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3272127.3275088"},{"key":"e_1_2_2_32_1","unstructured":"Kenneth Rose Alla Sheffer Jamie Wither Marie-Paule Cani and Boris Thibert. 2007. Developable surfaces from arbitrary sketched boundaries. In Comput. Graph. Forum. 163--172."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243593"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829948"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392419"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201356"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-006-0067-6"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201367"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1399504.1360676"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201303"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2832906"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1029164.1029168"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355089.3356541"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00060-6"},{"key":"e_1_2_2_45_1","first-page":"1","article-title":"Delaunay mesh simplification with differential evolution","volume":"37","author":"Yi Ran","year":"2018","unstructured":"Ran Yi, Yong-Jin Liu, and Ying He. 2018. Delaunay mesh simplification with differential evolution. ACM Trans. Graph. 37, 6 (2018), 1--12.","journal-title":"ACM Trans. Graph."},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14471"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3550454.3555451"},{"key":"e_1_2_2_48_1","volume-title":"Anisotropic surface meshing with conformal embedding. Graphical models 76, 5","author":"Zhong Zichun","year":"2014","unstructured":"Zichun Zhong, Liang Shuai, Miao Jin, and Xiaohu Guo. 2014. Anisotropic surface meshing with conformal embedding. Graphical models 76, 5 (2014), 468--483."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3592140","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3592140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:46Z","timestamp":1750178266000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3592140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,26]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10.1145\/3592140"],"URL":"https:\/\/doi.org\/10.1145\/3592140","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,26]]},"assertion":[{"value":"2023-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}