{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:30:17Z","timestamp":1777656617908,"version":"3.51.4"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["1096101"],"award-info":[{"award-number":["1096101"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["IIS-0612231CNS-0831374CCF-0702672CCF-0937139"],"award-info":[{"award-number":["IIS-0612231CNS-0831374CCF-0702672CCF-0937139"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["IIS-0612231CNS-0831374CCF-0702672CCF-0937139"],"award-info":[{"award-number":["IIS-0612231CNS-0831374CCF-0702672CCF-0937139"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0612231CNS-0831374CCF-0702672CCF-0937139"],"award-info":[{"award-number":["IIS-0612231CNS-0831374CCF-0702672CCF-0937139"]}],"id":[{"id":"10.13039\/100000145","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":[[2011,7]]},"abstract":"<jats:p>This paper describes a fully automatic pipeline for finding an intrinsic map between two non-isometric, genus zero surfaces. Our approach is based on the observation that efficient methods exist to search for nearly isometric maps (e.g., M\u00f6bius Voting or Heat Kernel Maps), but no single solution found with these methods provides low-distortion everywhere for pairs of surfaces differing by large deformations. To address this problem, we suggest using a weighted combination of these maps to produce a \"blended map.\" This approach enables algorithms that leverage efficient search procedures, yet can provide the flexibility to handle large deformations.<\/jats:p>\n          <jats:p>\n            The main challenges of this approach lie in finding a set of candidate maps {\n            <jats:italic>m<\/jats:italic>\n            <jats:sub>\n              <jats:italic>i<\/jats:italic>\n            <\/jats:sub>\n            } and their associated blending weights {\n            <jats:italic>b<\/jats:italic>\n            <jats:sub>\n              <jats:italic>i<\/jats:italic>\n            <\/jats:sub>\n            (\n            <jats:italic>p<\/jats:italic>\n            )} for every point\n            <jats:italic>p<\/jats:italic>\n            on the surface. We address these challenges specifically for conformal maps by making the following contributions. First, we provide a way to blend maps, defining the image of\n            <jats:italic>p<\/jats:italic>\n            as the weighted geodesic centroid of\n            <jats:italic>m<\/jats:italic>\n            <jats:sub>\n              <jats:italic>i<\/jats:italic>\n            <\/jats:sub>\n            (\n            <jats:italic>p<\/jats:italic>\n            ). Second, we provide a definition for smooth blending weights at every point\n            <jats:italic>p<\/jats:italic>\n            that are proportional to the area preservation of\n            <jats:italic>m<\/jats:italic>\n            <jats:sub>\n              <jats:italic>i<\/jats:italic>\n            <\/jats:sub>\n            at\n            <jats:italic>p<\/jats:italic>\n            . Third, we solve a global optimization problem that selects candidate maps based both on their area preservation and consistency with other selected maps. During experiments with these methods, we find that our algorithm produces blended maps that align semantic features better than alternative approaches over a variety of data sets.\n          <\/jats:p>","DOI":"10.1145\/2010324.1964974","type":"journal-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T14:17:46Z","timestamp":1311689866000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":269,"title":["Blended intrinsic maps"],"prefix":"10.1145","volume":"30","author":[{"given":"Vladimir G.","family":"Kim","sequence":"first","affiliation":[{"name":"Princeton University"}]},{"given":"Yaron","family":"Lipman","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Thomas","family":"Funkhouser","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"320","published-online":{"date-parts":[[2011,7,25]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00575"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","unstructured":"Allen B. Curless B. and Popovi\u0107 Z. 2003. The space of all body shapes: reconstruction and parameterization from range scans. ACM Transactions on Graphics (proc. SIGGRAPH). 10.1145\/882262.882311","DOI":"10.1145\/882262.882311"},{"key":"e_1_2_2_3_1","volume-title":"Proc. of the Neural Information Processing Systems.","author":"Anguelov D.","unstructured":"Anguelov, D., Srinivasan, P., Koller, D., Thrun, S., Pang, H., and Davis, J. 2004. The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces. Proc. of the Neural Information Processing Systems."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"},{"key":"e_1_2_2_5_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).","DOI":"10.1073\/pnas.0508601103"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","unstructured":"Bronstein A. M. Bronstein M. M. and Kimmel R. 2008. Numerical geometry of non-rigid shapes. Springer.","DOI":"10.5555\/1462123"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276404"},{"key":"e_1_2_2_8_1","unstructured":"Chang W. Li H. Mitra N. Pauly M. and Wand M. 2010. Geometric registration for deformable shapes. Eurographics 2010 course."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1281957.1281974"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1281920.1281953"},{"key":"e_1_2_2_12_1","volume-title":"Proc. SPIE 7261","author":"Ghosh D.","unstructured":"Ghosh, D., Sharf, A., and Amenta, N. 2009. Feature-driven deformation for dense correspondence. Proc. SPIE 7261."},{"key":"e_1_2_2_13_1","unstructured":"Giorgi D. Biasotti S. and Paraboschi L. 2007. Shrec:shape retrieval contest: Watertight models track. http:\/\/watertight.ge.imati.cnr.it\/."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","unstructured":"Golovinskiy A. and Funkhouser T. 2009. Consistent segmentation of 3D models. Computers and Graphics (Shape Modeling International 09) 33 3 (June) 262--269. 10.1016\/j.cag.2009.03.010","DOI":"10.1016\/j.cag.2009.03.010"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1731309.1731330"},{"key":"e_1_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Kim V. G. Lipman Y. Chen X. and Funkhouser T. 2010. Mobius transformations for global intrinsic symmetry analysis. Computer Graphics Forum (Proc. of SGP).","DOI":"10.1111\/j.1467-8659.2010.01778.x"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015811"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1731309.1731326"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531378"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057432.1057436"},{"key":"e_1_2_2_21_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).","DOI":"10.1111\/j.1467-8659.2010.01764.x"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1281920.1281925"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.1993.10504266"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383277"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015812"},{"key":"e_1_2_2_26_1","volume-title":"Proc. IEEE Conference on Computer Vision and Pattern Recognition.","author":"Tevs A.","unstructured":"Tevs, A., Bokeloh, M., M. Wand, Schilling, A., and Seidel, H.-P. 2009. Isometric registration of ambiguous and partial data. In: Proc. IEEE Conference on Computer Vision and Pattern Recognition."},{"key":"e_1_2_2_27_1","unstructured":"van Kaick O. Zhang H. Hamarneh G. and Cohen-Or D. 2010. A survey on shape correspondence. Eurographics State-of-the-Art report."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","unstructured":"Zhang H. Sheffer A. Cohen-Or D. Zhou Q. van Kaick O. and Tagliasacchi A. 2008. Deformation-driven shape correspondence. Computer Graphics Forum (Proc. of SGP).","DOI":"10.5555\/1731309.1731327"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2010324.1964974","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2010324.1964974","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2010324.1964974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:23Z","timestamp":1750244783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2010324.1964974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["10.1145\/2010324.1964974"],"URL":"https:\/\/doi.org\/10.1145\/2010324.1964974","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]},"assertion":[{"value":"2011-07-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}