{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T09:47:40Z","timestamp":1792403260256,"version":"4.4.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T00:00:00Z","timestamp":1500508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["257474 339025 340884"],"award-info":[{"award-number":["257474 339025 340884"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1655306"],"award-info":[{"award-number":["CCF-1655306"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2017,8,31]]},"abstract":"<jats:p>We introduce an efficient computational method for generating dense and low distortion maps between two arbitrary surfaces of same genus. Instead of relying on semantic correspondences or surface parameterization, we directly optimize a variance-minimizing transport plan between two input surfaces that defines an as-conformal-as-possible inter-surface map satisfying a user-prescribed bound on area distortion. The transport plan is computed via two alternating convex optimizations, and is shown to minimize a generalized Dirichlet energy of both the map and its inverse. Computational efficiency is achieved through a coarse-to-fine approach in diffusion geometry, with Sinkhorn iterations modified to enforce bounded area distortion. The resulting inter-surface mapping algorithm applies to arbitrary shapes robustly, with little to no user interaction.<\/jats:p>","DOI":"10.1145\/3072959.3073671","type":"journal-article","created":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T12:24:07Z","timestamp":1500639847000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Variance-minimizing transport plans for inter-surface mapping"],"prefix":"10.1145","volume":"36","author":[{"given":"Manish","family":"Mandad","sequence":"first","affiliation":[{"name":"RWTH Aachen University and Inria and Universit\u00e9 C\u00f4te d'Azur"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Cohen-Steiner","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leif","family":"Kobbelt","sequence":"additional","affiliation":[{"name":"RWTH Aachen University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Alliez","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathieu","family":"Desbrun","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,7,20]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/110845860"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818099"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601158"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766921"},{"key":"e_1_2_2_5_1","volume-title":"Proc. of Neural Information Processing Systems (NIPS). 33--40","author":"Anguelov Dragomir","year":"2004","unstructured":"Dragomir Anguelov , Praveen Srinivasan , Hoi-Cheung Pang , Daphne Koller , Sebastian Thrun , and James Davis . 2004 . The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces . In Proc. of Neural Information Processing Systems (NIPS). 33--40 . Dragomir Anguelov, Praveen Srinivasan, Hoi-Cheung Pang, Daphne Koller, Sebastian Thrun, and James Davis. 2004. The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces. In Proc. of Neural Information Processing Systems (NIPS). 33--40."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11428848_33"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331930008844513"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"e_1_2_2_9_1","volume-title":"Bronstein","author":"Boscaini Davide","year":"2016","unstructured":"Davide Boscaini , Jonathan Masci , Emanuele Rodol\u00e0 , and Michael M . Bronstein . 2016 . Learning Shape Correspondence with Anisotropic Convolutional Neural Networks. In Proceedings of Neural Information Processing Systems (NIPS) . Davide Boscaini, Jonathan Masci, Emanuele Rodol\u00e0, and Michael M. Bronstein. 2016. Learning Shape Correspondence with Anisotropic Convolutional Neural Networks. In Proceedings of Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_2_10_1","volume-title":"Numerical Geometry of Non-Rigid Shapes (1 ed.)","author":"Bronstein Alexander","unstructured":"Alexander Bronstein , Michael Bronstein , and Ron Kimmel . 2008. Numerical Geometry of Non-Rigid Shapes (1 ed.) . Springer . Alexander Bronstein, Michael Bronstein, and Ron Kimmel. 2008. Numerical Geometry of Non-Rigid Shapes (1 ed.). Springer."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0508601103"},{"key":"e_1_2_2_12_1","unstructured":"CGAL Project. 2016. CGAL User and Reference Manual (4.8 ed.). CGAL Editorial Board. http:\/\/doc.cgal.org\/4.8\/Manual\/packages.html  CGAL Project. 2016. CGAL User and Reference Manual (4.8 ed.). CGAL Editorial Board. http:\/\/doc.cgal.org\/4.8\/Manual\/packages.html"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.236"},{"key":"e_1_2_2_14_1","unstructured":"Lenaic Chizat Gabriel Peyr\u00e9 Bernhard Schmitzer and Fran\u00e7ois-Xavier Vialard. 2015. Unbalanced Optimal Transport: Geometry and Kantorovich Formulation. (2015). http:\/\/arxiv.org\/abs\/1508.05216  Lenaic Chizat Gabriel Peyr\u00e9 Bernhard Schmitzer and Fran\u00e7ois-Xavier Vialard. 2015. Unbalanced Optimal Transport: Geometry and Kantorovich Formulation. (2015). http:\/\/arxiv.org\/abs\/1508.05216"},{"key":"e_1_2_2_15_1","unstructured":"Lenaic Chizat Gabriel Peyr\u00e9 Bernhard Schmitzer and Fran\u00e7ois-Xavier Vialard. 2016. Scaling Algorithms for Unbalanced Transport Problems. (2016). https:\/\/arxiv.org\/abs\/1607.05816  Lenaic Chizat Gabriel Peyr\u00e9 Bernhard Schmitzer and Fran\u00e7ois-Xavier Vialard. 2016. Scaling Algorithms for Unbalanced Transport Problems. (2016). https:\/\/arxiv.org\/abs\/1607.05816"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0500334102"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12702"},{"key":"e_1_2_2_18_1","first-page":"2292","article-title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transport","volume":"26","author":"Cuturi Marco","year":"2013","unstructured":"Marco Cuturi . 2013 . Sinkhorn Distances: Lightspeed Computation of Optimal Transport . Adv. Neural Inf. Process. Syst. 26 (2013), 2292 -- 2300 . Marco Cuturi. 2013. Sinkhorn Distances: Lightspeed Computation of Optimal Transport. Adv. Neural Inf. Process. Syst. 26 (2013), 2292--2300.","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of Neural Information Processing Systems (NIPS). 2053--2061","author":"Frogner Charlie","year":"2015","unstructured":"Charlie Frogner , Chiyuan Zhang , Hossein Mobahi , Mauricio Araya-Polo , and Tomaso Poggio . 2015 . Learning with a Wasserstein Loss . In Proceedings of Neural Information Processing Systems (NIPS). 2053--2061 . Charlie Frogner, Chiyuan Zhang, Hossein Mobahi, Mauricio Araya-Polo, and Tomaso Poggio. 2015. Learning with a Wasserstein Loss. In Proceedings of Neural Information Processing Systems (NIPS). 2053--2061."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01896401"},{"key":"e_1_2_2_21_1","volume-title":"Shape retrieval contest 2007: Watertight models track. SHREC competition 8","author":"Giorgi Daniela","year":"2007","unstructured":"Daniela Giorgi , Silvia Biasotti , and Laura Paraboschi . 2007. Shape retrieval contest 2007: Watertight models track. SHREC competition 8 ( 2007 ). Daniela Giorgi, Silvia Biasotti, and Laura Paraboschi. 2007. Shape retrieval contest 2007: Watertight models track. SHREC competition 8 (2007)."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964974"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015811"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185604"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9093-5"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461970"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.07.004"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185526"},{"key":"e_1_2_2_29_1","volume-title":"Spectra: A header-only C++ library for large scale eigenvalue problems.","author":"Qiu Yixuan","year":"2016","unstructured":"Yixuan Qiu , Gael Guennebaud , and Jitse Niesen . 2016 . Spectra: A header-only C++ library for large scale eigenvalue problems. (2016). http:\/\/yixuan.cos.name\/spectra\/ Yixuan Qiu, Gael Guennebaud, and Jitse Niesen. 2016. Spectra: A header-only C++ library for large scale eigenvalue problems. (2016). http:\/\/yixuan.cos.name\/spectra\/"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016313"},{"key":"e_1_2_2_31_1","volume-title":"Proceedings of VMV. 25--32","author":"Rodol\u00e0 Emanuele","year":"2015","unstructured":"Emanuele Rodol\u00e0 , Michael Moeller , and Daniel Cremers . 2015 . Point-wise Map Recovery and Refinement from Functional Correspondence . In Proceedings of VMV. 25--32 . Emanuele Rodol\u00e0, Michael Moeller, and Daniel Cremers. 2015. Point-wise Map Recovery and Refinement from Functional Correspondence. In Proceedings of VMV. 25--32."},{"key":"e_1_2_2_32_1","unstructured":"Bernhard Schmitzer. 2016. Scaling Algorithms for Unbalanced Transport Problems. (2016). https:\/\/arxiv.org\/abs\/1610.06519  Bernhard Schmitzer. 2016. Scaling Algorithms for Unbalanced Transport Problems. (2016). https:\/\/arxiv.org\/abs\/1610.06519"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015812"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2015.02.004"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766963"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12186"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03167.x"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925903"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01515.x"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01884.x"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.707"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3072959.3073671","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3072959.3073671","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3072959.3073671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:23Z","timestamp":1750217423000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3072959.3073671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,20]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8,31]]}},"alternative-id":["10.1145\/3072959.3073671"],"URL":"https:\/\/doi.org\/10.1145\/3072959.3073671","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,20]]},"assertion":[{"value":"2017-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}