%0 Journal Article %1 Denning:2013:MDM:2461912.2461942 %A Denning, Jonathan D. %A Pellacini, Fabio %C New York, NY, USA %D 2013 %I ACM %J ACM Trans. Graph. %K 2013 geometry mesh modeling polygon siggraph %N 4 %P 35:1--35:10 %R 10.1145/2461912.2461942 %T MeshGit: Diffing and Merging Meshes for Polygonal Modeling %U https://dl.acm.org/citation.cfm?id=2461942 %V 32 %X This paper presents MeshGit, 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 mesh edit distance 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 MeshGit by diffing and merging a variety of meshes and find it to work well for all.

@article{Denning:2013:MDM:2461912.2461942, abstract = {This paper presents MeshGit, 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 mesh edit distance 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 MeshGit by diffing and merging a variety of meshes and find it to work well for all.}, acmid = {2461942}, added-at = {2019-03-16T16:34:10.000+0100}, address = {New York, NY, USA}, articleno = {35}, author = {Denning, Jonathan D. and Pellacini, Fabio}, biburl = {https://www.bibsonomy.org/bibtex/25f6f51f2e06165a20e1bb60a7803fdaf/analyst}, description = {MeshGit}, doi = {10.1145/2461912.2461942}, interhash = {422196f84a2e16651d36915a2300ed98}, intrahash = {5f6f51f2e06165a20e1bb60a7803fdaf}, issn = {0730-0301}, issue_date = {July 2013}, journal = {ACM Trans. Graph.}, keywords = {2013 geometry mesh modeling polygon siggraph}, month = jul, number = 4, numpages = {10}, pages = {35:1--35:10}, publisher = {ACM}, timestamp = {2019-03-16T16:47:50.000+0100}, title = {MeshGit: Diffing and Merging Meshes for Polygonal Modeling}, url = {https://dl.acm.org/citation.cfm?id=2461942}, volume = 32, year = 2013 }