{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:38:06Z","timestamp":1775230686478,"version":"3.50.1"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,7,21]],"date-time":"2013-07-21T00:00:00Z","timestamp":1374364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0746117)"],"award-info":[{"award-number":["CCF-0746117)"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","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":[[2013,7,21]]},"abstract":"<jats:p>This paper presents<jats:italic>MeshGit<\/jats:italic>, a practical algorithm for diffing and merging polygonal meshes typically used in subdivision modeling workflows. Inspired by version control for text editing, we introduce the<jats:italic>mesh edit distance<\/jats:italic>as a measure of the dissimilarity between meshes. This distance is defined as the minimum cost of matching the vertices and faces of one mesh to those of another. We propose an iterative greedy algorithm to approximate the mesh edit distance, which scales well with model complexity, providing a practical solution to our problem. We translate the mesh correspondence into a set of mesh editing operations that transforms the first mesh into the second. The editing operations can be displayed directly to provide a meaningful visual difference between meshes. For merging, we compute the difference between two versions and their common ancestor, as sets of editing operations. We robustly detect conflicting operations, automatically apply non-conflicting edits, and allow the user to choose how to merge the conflicting edits. We evaluate<jats:italic>MeshGit<\/jats:italic>by diffing and merging a variety of meshes and find it to work well for all.<\/jats:p>","DOI":"10.1145\/2461912.2461942","type":"journal-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:45Z","timestamp":1373998005000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["MeshGit"],"prefix":"10.1145","volume":"32","author":[{"given":"Jonathan D.","family":"Denning","sequence":"first","affiliation":[{"name":"Dartmouth College"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Pellacini","sequence":"additional","affiliation":[{"name":"Dartmouth College and Sapienza University of Rome"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,21]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Blender Foundation 2011. Sintel. www.sintel.org. Blender Foundation 2011. Sintel. www.sintel.org."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276404"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1731309.1731331"},{"key":"e_1_2_2_5_1","unstructured":"Chang W. Li H. Mitra N. Pauly M. Rusinkiewicz S. and Wand M. 2011. Computing correspondences in geometric data sets. In Eurographics Tutorial Notes. Chang W. Li H. Mitra N. Pauly M. Rusinkiewicz S. and Wand M. 2011. Computing correspondences in geometric data sets. In Eurographics Tutorial Notes ."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882261.1866205"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964930"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1965000"},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Cour T. Srinivasan P. and Shi J. 2006. Balanced graph matching. In NIPS 313--320. Cour T. Srinivasan P. and Shi J. 2006. Balanced graph matching. In NIPS 313--320.","DOI":"10.7551\/mitpress\/7503.003.0044"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964961"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2407746.2407766"},{"key":"e_1_2_2_12_1","volume-title":"Proc. 3DPVT.","author":"Dubrovina A.","unstructured":"Dubrovina , A. , and Kimmel , R . 2010. Matching shapes by eigendecomposition of the laplace-beltrami operator . In Proc. 3DPVT. Dubrovina, A., and Kimmel, R. 2010. Matching shapes by eigendecomposition of the laplace-beltrami operator. In Proc. 3DPVT."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-009-0363-z"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1964921.1964974"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"e_1_2_2_17_1","first-page":"8","article-title":"Binary codes capable of correcting spurious insertions and deletions of ones","volume":"1","author":"Levenshtein V. I.","year":"1965","unstructured":"Levenshtein , V. I. 1965 . Binary codes capable of correcting spurious insertions and deletions of ones . Probl. Inf. Transmission 1 , 8 -- 17 . Levenshtein, V. I. 1965. Binary codes capable of correcting spurious insertions and deletions of ones. Probl. Inf. Transmission 1, 8--17.","journal-title":"Probl. Inf. Transmission"},{"key":"e_1_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Neuhaus M. and Bunke H. 2007. Bridging the gap between graph edit distance and kernel machines. World Scientific. Neuhaus M. and Bunke H. 2007. Bridging the gap between graph edit distance and kernel machines . World Scientific.","DOI":"10.1142\/6523"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"e_1_2_2_20_1","volume-title":"International Conference on 3D Digital Imaging and Modeling.","author":"Rusinkiewicz S.","unstructured":"Rusinkiewicz , S. , and Levoy , M . 2001. Efficient variants of the icp algorithm . International Conference on 3D Digital Imaging and Modeling. Rusinkiewicz, S., and Levoy, M. 2001. Efficient variants of the icp algorithm. International Conference on 3D Digital Imaging and Modeling."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-006-0068-5"},{"key":"e_1_2_2_22_1","volume-title":"European Conference on Computer Vision, 743--756","author":"Sharma A.","unstructured":"Sharma , A. , von Lavante , E. , and Horaud , R. P . 2010. Learning shape segmentation using constrained spectral clustering and probabilistic label transfer . In European Conference on Computer Vision, 743--756 . Sharma, A., von Lavante, E., and Horaud, R. P. 2010. Learning shape segmentation using constrained spectral clustering and probabilistic label transfer. In European Conference on Computer Vision, 743--756."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995455"},{"key":"e_1_2_2_24_1","unstructured":"VisTrails 2010. VisTrails Provenance Explorer for Maya. www.vistrails.com\/maya.html. VisTrails 2010. VisTrails Provenance Explorer for Maya. www.vistrails.com\/maya.html."},{"key":"e_1_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Zeng Y. Wang C. Wang Y. Gu X. Samaras D. and Paragios N. 2010. Dense non-rigid surface registration using high-order graph matching. In Computer Vision and Pattern Recognition 382--389. Zeng Y. Wang C. Wang Y. Gu X. Samaras D. and Paragios N. 2010. Dense non-rigid surface registration using high-order graph matching. In Computer Vision and Pattern Recognition 382--389.","DOI":"10.1109\/CVPR.2010.5540189"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2461912.2461942","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2461912.2461942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:48Z","timestamp":1750235748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2461912.2461942"}},"subtitle":["diffing and merging meshes for polygonal modeling"],"short-title":[],"issued":{"date-parts":[[2013,7,21]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7,21]]}},"alternative-id":["10.1145\/2461912.2461942"],"URL":"https:\/\/doi.org\/10.1145\/2461912.2461942","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,21]]},"assertion":[{"value":"2013-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}