{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T01:22:44Z","timestamp":1775870564881,"version":"3.50.1"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,7,27]],"date-time":"2014-07-27T00:00:00Z","timestamp":1406419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","award":["11-Apr"],"award-info":[{"award-number":["11-Apr"]}],"id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1284\/12"],"award-info":[{"award-number":["1284\/12"]}],"id":[{"id":"10.13039\/501100003977","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":[[2014,7,27]]},"abstract":"<jats:p>This paper introduces an algorithm for computing low-distortion, bijective mappings between surface meshes. The algorithm recieves as input a coarse set of corresponding pairs of points on the two surfaces, and follows three steps: (i) cutting the two meshes to disks in a consistent manner; (ii) jointly flattening the two disks via a novel formulation for minimizing isometric distortion while guaranteeing local injectivity (the flattenings can overlap, however); and (iii) computing a unique continuous bijection that is consistent with the flattenings.<\/jats:p>\n          <jats:p>\n            The construction of the algorithm stems from two novel observations: first, bijections between disk-type surfaces can be uniquely and efficiently represented via consistent\n            <jats:italic>locally<\/jats:italic>\n            injective flattenings that are allowed to be globally overlapping. This observation reduces the problem of computing bijective surface mappings to the task of computing locally injective flattenings, which is shown to be easier. Second, locally injective flattenings that minimize isometric distortion can be efficiently characterized and optimized in a convex framework.\n          <\/jats:p>\n          <jats:p>Experiments that map a wide baseline of pairs of surface meshes using the algorithm are provided. They demonstrate the ability of the algorithm to produce high-quality continuous bijective mappings between pairs of surfaces of varying isometric distortion levels.<\/jats:p>","DOI":"10.1145\/2601097.2601158","type":"journal-article","created":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T15:08:20Z","timestamp":1406041700000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":83,"title":["Lifted bijections for low distortion surface mappings"],"prefix":"10.1145","volume":"33","author":[{"given":"Noam","family":"Aigerman","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science"}]},{"given":"Roi","family":"Poranne","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science"}]},{"given":"Yaron","family":"Lipman","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science"}]}],"member":"320","published-online":{"date-parts":[[2014,7,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882311"},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Andersen E. D. and Andersen K. D. 1999. The MOSEK interior point optimization for linear programming: an implementation of the homogeneous algorithm. Kluwer Academic Publishers 197--232.  Andersen E. D. and Andersen K. D. 1999. The MOSEK interior point optimization for linear programming: an implementation of the homogeneous algorithm . Kluwer Academic Publishers 197--232.","DOI":"10.1007\/978-1-4757-3216-0_8"},{"key":"e_1_2_2_3_1","volume-title":"Proc. of the Neural Information Processing Systems.","author":"Anguelov D."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073207"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Boyd S. P. and Vandenberghe L. 2004. Convex optimization. Cambridge university press.   Boyd S. P. and Vandenberghe L. 2004. Convex optimization . Cambridge university press.","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360698"},{"key":"e_1_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Bronstein A. M. Bronstein M. M. and Kimmel R. 2006. Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching. Proc. National Academy of Sciences (PNAS).  Bronstein A. M. Bronstein M. M. and Kimmel R. 2006. Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching. Proc. National Academy of Sciences (PNAS) .","DOI":"10.1073\/pnas.0508601103"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276404"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1077-3142(03)00009-2"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Floater M. S. and Hormann K. 2005. Surface parameterization: a tutorial and survey. In Advances in multiresolution for geometric modelling. Springer 157--186.  Floater M. S. and Hormann K. 2005. Surface parameterization: a tutorial and survey. In Advances in multiresolution for geometric modelling . Springer 157--186.","DOI":"10.1007\/3-540-26808-1_9"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-02-01466-7"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8396(02)00002-5"},{"key":"e_1_2_2_14_1","volume-title":"SHREC: SHape REtrieval Contest: Watertight models track","author":"Giorgi D.","year":"2007"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566589"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2004.831226"},{"key":"e_1_2_2_17_1","volume-title":"MIPS: An efficient global parametrization method. In Curve and Surface Design: Saint-Malo","author":"Hormann K.","year":"2000"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281500.1281510"},{"key":"e_1_2_2_19_1","volume-title":"Computer Graphics Forum (Proc. SGP","author":"Huang Q.","year":"2008"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218654307000968"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964974"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015811"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311586"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1731309.1731326"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/604471.604502"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531378"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185604"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"e_1_2_2_29_1","first-page":"309","article-title":"Extensions of normal immersions of S1 into R2","volume":"187","author":"Marx M. L.","year":"1974","journal-title":"Transactions of the American Mathematical Society"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-004-0145-y"},{"key":"e_1_2_2_31_1","volume-title":"Computer Graphics and Applications, 2001. Proceedings. Ninth Pacific Conference on, 60--69","author":"Michikawa T."},{"key":"e_1_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Ovsjanikov M. M\u00e9rigot Q. M\u00e9moli F. and Guibas L. 2010. One point isometric matching with the heat kernel. In Computer Graphics Forum (Proc. of SGP).  Ovsjanikov M. M\u00e9rigot Q. M\u00e9moli F. and Guibas L. 2010. One point isometric matching with the heat kernel. In Computer Graphics Forum (Proc. of SGP) .","DOI":"10.1111\/j.1467-8659.2010.01764.x"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185526"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12076"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461935"},{"key":"e_1_2_2_36_1","volume-title":"Symposium on Geometry Processing, 23--32","author":"Pauly M."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383277"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383307"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015812"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000011"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03167.x"},{"key":"e_1_2_2_42_1","volume-title":"Proceedings of the Conference on Visualization '02, IEEE Computer Society, Washington, DC, USA, VIS '02, 355--362","author":"Sorkine O."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073228"},{"key":"e_1_2_2_44_1","volume-title":"Proc. IEEE Conference on Computer Vision and Pattern Recognition.","author":"Tevs A."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01884.x"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03596-8_23"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2601097.2601158","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2601097.2601158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:10Z","timestamp":1750231150000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2601097.2601158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,27]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7,27]]}},"alternative-id":["10.1145\/2601097.2601158"],"URL":"https:\/\/doi.org\/10.1145\/2601097.2601158","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,27]]},"assertion":[{"value":"2014-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}