{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:50:03Z","timestamp":1772808603827,"version":"3.50.1"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Zhejiang Lab","award":["NO. 2019NB0AB03"],"award-info":[{"award-number":["NO. 2019NB0AB03"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802359, 62025207"],"award-info":[{"award-number":["61802359, 62025207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"USTC Research Funds of theDouble First-Class Initiative","award":["YD0010002003"],"award-info":[{"award-number":["YD0010002003"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:p>\n            We propose a novel method to generate sparse cone singularities with bounded distortion constraints for conformal parameterizations. It is formulated as minimizing the\n            <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>0<\/jats:sub>\n            -norm of Gaussian curvature of vertices with hard constraints of bounding the distortion that is measured by the\n            <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            -norm of the log conformal factor. We use the reweighted\n            <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            -norm to approximate the\n            <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>0<\/jats:sub>\n            -norm and solve each convex weighted\n            <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            minimization subproblem by the Douglas-Rachford (DR) splitting scheme. To quickly generate sparse cones, we modify DR splitting by weighting the\n            <jats:italic>\u2113<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            -norm of the proximal mapping to force the small Gaussian curvature to quickly approach zero. Accordingly, compared with the conventional DR splitting, the modified method performs one to two orders of magnitude faster. Besides, we perform variable substitution of log conformal factors to simplify the computation process for acceleration. Our algorithm is able to bound distortion to compute sparse cone singularities, so that the resulting conformal parameterizations achieve a favorable tradeoff between the area distortion and the number of cones. We demonstrate its effectiveness and feasibility on a large number of models.\n          <\/jats:p>","DOI":"10.1145\/3478513.3480526","type":"journal-article","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T18:29:20Z","timestamp":1639160960000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Computing sparse cones with bounded distortion for conformal parameterizations"],"prefix":"10.1145","volume":"40","author":[{"given":"Qing","family":"Fang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, China"}]},{"given":"Wenqing","family":"Ouyang","sequence":"additional","affiliation":[{"name":"Chinese University of Hongkong (Shenzhen), China"}]},{"given":"Mo","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}]},{"given":"Ligang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}]},{"given":"Xiao-Ming","family":"Fu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}]}],"member":"320","published-online":{"date-parts":[[2021,12,10]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/829510.830318"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00115-1"},{"key":"e_1_2_2_3_1","volume-title":"Some nonlinear problems in Riemannian geometry","author":"Aubin Thierry","unstructured":"Thierry Aubin . 2013. Some nonlinear problems in Riemannian geometry . Springer Science & Business Media . Thierry Aubin. 2013. Some nonlinear problems in Riemannian geometry. Springer Science & Business Media."},{"key":"e_1_2_2_4_1","volume-title":"Orthogonal distance from an ellipsoid. Boletim de Ci\u011bncias Geod\u00e9sicas 20 (10","author":"Bektas Sebahattin","year":"2014","unstructured":"Sebahattin Bektas . 2014. Orthogonal distance from an ellipsoid. Boletim de Ci\u011bncias Geod\u00e9sicas 20 (10 2014 ), 970--983. Sebahattin Bektas. 2014. Orthogonal distance from an ellipsoid. Boletim de Ci\u011bncias Geod\u00e9sicas 20 (10 2014), 970--983."},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01142.x"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12014"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2007.05.002"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288639"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360511"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2018.05.007"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2947420"},{"key":"e_1_2_2_13_1","unstructured":"Keenan Crane. 2019. The n-dimensional cotangent formula. https:\/\/www.cs.cmu.edu\/kmcrane\/Projects\/Other\/nDCotanFormula.pdf.  Keenan Crane. 2019. The n-dimensional cotangent formula. https:\/\/www.cs.cmu.edu\/kmcrane\/Projects\/Other\/nDCotanFormula.pdf."},{"key":"e_1_2_2_14_1","volume-title":"Intrinsic Parameterizations of Surface Meshes. Comput. Graph. Forum","author":"Desbrun Mathieu","year":"2002","unstructured":"Mathieu Desbrun , Mark Meyer , and Pierre Alliez . 2002. Intrinsic Parameterizations of Surface Meshes. Comput. Graph. Forum ( 2002 ). Mathieu Desbrun, Mark Meyer, and Pierre Alliez. 2002. Intrinsic Parameterizations of Surface Meshes. Comput. Graph. Forum (2002)."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766906"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1956-0084194-4"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2020.102863"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201375"},{"key":"e_1_2_2_19_1","unstructured":"Michel Fortin and Roland Glowinski. 2000. Augmented Lagrangian methods: applications to the numerical solution of boundary-value problems.  Michel Fortin and Roland Glowinski. 2000. Augmented Lagrangian methods: applications to the numerical solution of boundary-value problems."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.09.001"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41095-021-0233-9"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2564160"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566589"},{"key":"e_1_2_2_24_1","unstructured":"Ga\u00ebl Guennebaud Beno\u00eet Jacob etal 2010. Eigen v3. http:\/\/eigen.tuxfamily.org.  Ga\u00ebl Guennebaud Beno\u00eet Jacob et al. 2010. Eigen v3. http:\/\/eigen.tuxfamily.org."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461965"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602141"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138450.1138461"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02333413"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925944"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566590"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306346.3323001"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1776684.1776736"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185605"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14081"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132705"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/882487.884118"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/602099.602144"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201367"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1399504.1360676"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392435"},{"key":"e_1_2_2_42_1","first-page":"1807","article-title":"Spectral Mesh Segmentation via &ell;0 Gradient Minimization","volume":"26","author":"Tong W.","year":"2020","unstructured":"W. Tong , X. Yang , M. Pan , and F. Chen . 2020 . Spectral Mesh Segmentation via &ell;0 Gradient Minimization . IEEE. T. Vis. Comput. Gr. 26 , 4 (2020), 1807 -- 1820 . W. Tong, X. Yang, M. Pan, and F. Chen. 2020. Spectral Mesh Segmentation via &ell;0 Gradient Minimization. IEEE. T. Vis. Comput. Gr. 26, 4 (2020), 1807--1820.","journal-title":"IEEE. T. Vis. Comput. Gr."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12864"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2845842"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024208"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2015.06.012"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2020.101854"},{"key":"e_1_2_2_48_1","volume-title":"Sparse optimization theory and methods","author":"Zhao Yun-Bin","unstructured":"Yun-Bin Zhao . 2018. Sparse optimization theory and methods . CRC Press . Yun-Bin Zhao. 2018. Sparse optimization theory and methods. CRC Press."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2014.03.011"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13923"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478513.3480526","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3478513.3480526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:49Z","timestamp":1750191109000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478513.3480526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":50,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1145\/3478513.3480526"],"URL":"https:\/\/doi.org\/10.1145\/3478513.3480526","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"2021-12-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}