On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
SnapPaste: an interactive technique for easy mesh composition
The Visual Computer: International Journal of Computer Graphics
Global non-rigid alignment of 3-D scans
ACM SIGGRAPH 2007 papers
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
Bridging the Gap Between Graph Edit Distance and Kernel Machines
Bridging the Gap Between Graph Edit Distance and Kernel Machines
Approximate topological matching of quad meshes
The Visual Computer: International Journal of Computer Graphics - Special Issue SMI'2008
A survey of graph edit distance
Pattern Analysis & Applications
Automatic registration for articulated shapes
SGP '08 Proceedings of the Symposium on Geometry Processing
Data-driven suggestions for creativity support in 3D modeling
ACM SIGGRAPH Asia 2010 papers
Learning shape segmentation using constrained spectral clustering and probabilistic label transfer
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Probabilistic reasoning for assembly-based 3D modeling
ACM SIGGRAPH 2011 papers
MeshFlow: interactive visualization of mesh construction sequences
ACM SIGGRAPH 2011 papers
ACM SIGGRAPH 2011 papers
Nonlinear revision control for images
ACM SIGGRAPH 2011 papers
Topologically-robust 3D shape matching based on diffusion geometry and seed growing
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
3D Diff: an interactive approach to mesh differencing and conflict resolution
SIGGRAPH Asia 2012 Technical Briefs
Hi-index | 0.00 |
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.