{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:40:57Z","timestamp":1776847257589,"version":"3.51.2"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"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":["ERC-StG-205693"],"award-info":[{"award-number":["ERC-StG-205693"]}],"id":[{"id":"10.13039\/501100000781","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,12]]},"abstract":"<jats:p>\n            Interpolation between pairs of values, typically vectors, is a fundamental operation in many computer graphics applications. In some cases simple linear interpolation yields meaningful results without requiring domain knowledge. However, interpolation between pairs of distributions or pairs of functions often demands more care because features may exhibit translational motion between exemplars. This property is not captured by linear interpolation. This paper develops the use of\n            <jats:italic>displacement interpolation<\/jats:italic>\n            for this class of problem, which provides a generic method for interpolating between distributions or functions based on advection instead of blending. The functions can be non-uniformly sampled, high-dimensional, and defined on non-Euclidean manifolds, e.g., spheres and tori. Our method decomposes distributions or functions into sums of radial basis functions (RBFs). We solve a mass transport problem to pair the RBFs and apply partial transport to obtain the interpolated function. We describe practical methods for computing the RBF decomposition and solving the transport problem. We demonstrate the interpolation approach on synthetic examples, BRDFs, color distributions, environment maps, stipple patterns, and value functions.\n          <\/jats:p>","DOI":"10.1145\/2070781.2024192","type":"journal-article","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T13:58:46Z","timestamp":1322661526000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":124,"title":["Displacement interpolation using Lagrangian mass transport"],"prefix":"10.1145","volume":"30","author":[{"given":"Nicolas","family":"Bonneel","sequence":"first","affiliation":[{"name":"University of British Columbia, and ALICE\/INRIA Nancy"}]},{"given":"Michiel","family":"van de Panne","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]},{"given":"Sylvain","family":"Paris","sequence":"additional","affiliation":[{"name":"Adobe Systems, Inc."}]},{"given":"Wolfgang","family":"Heidrich","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]}],"member":"320","published-online":{"date-parts":[[2011,12,12]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Ahmad N. Hwa Kil K. and McCann R. 2010. Optimal transportation topology and uniqueness. arXiv:1008.4419vl.  Ahmad N. Hwa Kil K. and McCann R. 2010. Optimal transportation topology and uniqueness. arXiv:1008.4419vl."},{"key":"e_1_2_2_2_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.2000.10487522"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050002"},{"key":"e_1_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Bieling J. Peschlow P. and Martini P. 2010. An efficient GPU implementation of the revised simplex method. 1--8.  Bieling J. Peschlow P. and Martini P. 2010. An efficient GPU implementation of the revised simplex method. 1--8.","DOI":"10.1109\/IPDPSW.2010.5470831"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(95)00216-2"},{"key":"e_1_2_2_7_1","volume-title":"Tsnnls: A solver for large sparse least squares problems with non-negative variables. CoRR cs.MS\/0408029.","author":"Cantarella J.","year":"2004"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576246.1531388"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1833349.1778835"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1953.3.369"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000036836.66311.97"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276412"},{"key":"e_1_2_2_13_1","unstructured":"HDRShop . LightGen plug-in. http:\/\/gl.ict.usc.edu\/HDRShop\/lightgen\/.  HDRShop . LightGen plug-in. http:\/\/gl.ict.usc.edu\/HDRShop\/lightgen\/."},{"key":"e_1_2_2_14_1","volume-title":"Introduction to Operations Research","author":"Hlllier F. S., AND","edition":"5"},{"key":"e_1_2_2_15_1","volume-title":"Proc. of the 4th Int. Conf. on Scale space methods in Computer Vision, 33--43","author":"Kanters F."},{"key":"e_1_2_2_16_1","unstructured":"Kelly D. J. and O'Neill G. M. 1991. The minimum cost flow problem and the network simplex method September.  Kelly D. J. and O'Neill G. M. 1991. The minimum cost flow problem and the network simplex method September."},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Lawson C. L. and Hanson R. J. 1995. Solving least squares problems 3 ed.  Lawson C. L. and Hanson R. J. 1995. Solving least squares problems 3 ed.","DOI":"10.1137\/1.9781611971217"},{"key":"e_1_2_2_18_1","volume-title":"LEMON: Library for efficient modeling and optimization in networks","author":"LEMON","year":"2010"},{"key":"e_1_2_2_19_1","volume-title":"Rendering Techniques. Proc. of Eurographics Rendering Workshop.","author":"Lensch H. P. A."},{"key":"e_1_2_2_20_1","volume-title":"Conformal Wasserstein distances: comparing surfaces in polynomial time. Advances in Mathematics","author":"Lipman Y."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/100799083"},{"key":"e_1_2_2_22_1","unstructured":"MacDonald D. 2006. A C++ implementation of the transportation simplex algorithm http:\/\/www.site.uottawa.ca\/~dmacd070\/emd\/.  MacDonald D. 2006. A C++ implementation of the transportation simplex algorithm http:\/\/www.site.uottawa.ca\/~dmacd070\/emd\/."},{"key":"e_1_2_2_23_1","volume-title":"Proc. 10th Asian conference on Computer vision, 202--215","author":"Makihara Y"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882343"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073262"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1997.1634"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00328-8"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383894.2383945"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015750"},{"key":"e_1_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Pele O. and Werman M. 2009. Fast and robust earth mover's distances. In ICCV.  Pele O. and Werman M. 2009. Fast and robust earth mover's distances. In ICCV .","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344812"},{"key":"e_1_2_2_32_1","unstructured":"Pharr M. and Humphreys G. 2010. Physically Based Rendering Second Edition: From Theory To Implementation. Morgan Kaufmann July.   Pharr M. and Humphreys G. 2010. Physically Based Rendering Second Edition: From Theory To Implementation . Morgan Kaufmann July."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.166"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311545"},{"key":"e_1_2_2_35_1","unstructured":"Rabin J. Peyr\u00e9 G. Delon J. and Bernot M. 2010. Wasserstein Barycenter and its Application to Texture Mixing. Tech. rep.  Rabin J. Peyr\u00e9 G. Delon J. and Bernot M. 2010. Wasserstein Barycenter and its Application to Texture Mixing. Tech. rep."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9002(98)01347-3"},{"key":"e_1_2_2_37_1","volume-title":"Proc. of the 18th British Machine Vision Conference, 102--111","author":"Rehman T. u."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.media.2008.10.008"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_2_2_40_1","unstructured":"Rubner Y 1998. Code for the Earth Mover's Distance (EMD). http:\/\/vision.Stanford.edu\/~rubner\/emd\/.  Rubner Y 1998. Code for the Earth Mover's Distance (EMD). http:\/\/vision.Stanford.edu\/~rubner\/emd\/."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6453-2_2"},{"key":"e_1_2_2_42_1","volume-title":"Rendering Techniques (Proc. Eurographics Workshop on Rendering), 215--226","author":"Secord A."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1661412.1618493"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.2312\/EGWR\/EGSR05\/111-116"},{"key":"e_1_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Villani C. 2003. Topics in Optimal Transportation (Graduate Studies in Mathematics Vol. 58). American Mathematical Society March.  Villani C. 2003. Topics in Optimal Transportation (Graduate Studies in Mathematics Vol. 58) . American Mathematical Society March.","DOI":"10.1090\/gsm\/058"},{"key":"e_1_2_2_46_1","volume-title":"Optimal Transport: Old and New, 1 ed. Grundlehren der mathematischen Wissenschaften","author":"Villani C.","year":"2008"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559755.1559760"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.299"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.896637"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2070781.2024192","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2070781.2024192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:03Z","timestamp":1750241163000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2070781.2024192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1145\/2070781.2024192"],"URL":"https:\/\/doi.org\/10.1145\/2070781.2024192","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"2011-12-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}