Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

MeshGit: diffing and merging meshes for polygonal modeling

Published: 21 July 2013 Publication History

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.

Supplementary Material

ZIP File (a35-denning.zip)
Supplemental material.
MP4 File (tp059.mp4)

References

[1]
Blender Foundation, 2011. Sintel. www.sintel.org.
[2]
Brown, B. J., and Rusinkiewicz, S. 2007. Global non-rigid alignment of 3-d scans. ACM Transactions on Graphics 26, 3 (July), 21:1--21:9.
[3]
Bunke, H. 1998. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18, 689--694.
[4]
Chang, W., and Zwicker, M. 2008. Automatic registration for articulated shapes. Computer Graphics Forum 27, 5, 1459--1468.
[5]
Chang, W., Li, H., Mitra, N., Pauly, M., Rusinkiewicz, S., and Wand, M. 2011. Computing correspondences in geometric data sets. In Eurographics Tutorial Notes.
[6]
Chaudhuri, S., and Koltun, V. 2010. Data-driven suggestions for creativity support in 3d modeling. ACM Transactions on Graphics 26, 6, 183:1--183:10.
[7]
Chaudhuri, S., Kalogerakis, E., Guibas, L., and Koltun, V. 2011. Probabilistic reasoning for assembly-based 3D modeling. ACM Transactions on Graphics 30, 4, 35:1--35:10.
[8]
Chen, H.-T., Wei, L.-Y., and Chang, C.-F. 2011. Nonlinear revision control for images. ACM Transaction on Graphics 30, 4, 105:1--105:10.
[9]
Cour, T., Srinivasan, P., and Shi, J. 2006. Balanced graph matching. In NIPS, 313--320.
[10]
Denning, J. D., Kerr, W. B., and Pellacini, F. 2011. Mesh-flow: interactive visualization of mesh construction sequences. ACM Transaction on Graphics 30, 4, 66:1--66:8.
[11]
Doboš, J., and Steed, A. 2012. 3D Diff: an interactive approach to mesh differencing and conflict resolution. In SIGGRAPH Asia 2012 Technical Briefs, ACM, New York, NY, USA, SA '12, 20:1--20:4.
[12]
Dubrovina, A., and Kimmel, R. 2010. Matching shapes by eigendecomposition of the laplace-beltrami operator. In Proc. 3DPVT.
[13]
Eppstein, D., Goodrich, M. T., Kim, E., and Tamstorf, R. 2009. Approximate topological matching of quad meshes. The Visual Computer, 771--783.
[14]
Gao, X., Xiao, B., Tao, D., and Li, X. 2010. A survey of graph edit distance. Pattern Analysis and Applications 13, 113--129.
[15]
Kim, V. G., Lipman, Y., and Funkhouser, T. 2011. Blended intrinsic maps. SIGGRAPH, 79:1--79:12.
[16]
Leordeanu, M., and Hebert, M. 2005. A spectral technique for correspondence problems using pairwise constraints. In International Conference on Computer Vision, 1482--1489.
[17]
Levenshtein, V. I. 1965. Binary codes capable of correcting spurious insertions and deletions of ones. Probl. Inf. Transmission 1, 8--17.
[18]
Neuhaus, M., and Bunke, H. 2007. Bridging the gap between graph edit distance and kernel machines. World Scientific.
[19]
Riesen, K., and Bunke, H. 2009. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing 27, 950--959.
[20]
Rusinkiewicz, S., and Levoy, M. 2001. Efficient variants of the icp algorithm. International Conference on 3D Digital Imaging and Modeling.
[21]
Sharf, A., Blumenkrants, M., Shamir, A., and Cohen-Or, D. 2006. Snappaste: an interactive technique for easy mesh composition. The Visual Computer 22, 835--844.
[22]
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.
[23]
Sharma, A., Horaud, R. P., Cech, J., and Boyer, E. 2011. Topologically-robust 3d shape matching based on diffusion geometry and seed growing. In Computer Vision and Pattern Recognition, 2481--2488.
[24]
VisTrails, 2010. VisTrails Provenance Explorer for Maya. www.vistrails.com/maya.html.
[25]
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.

Cited By

View all
  • (2023)NodeGit: Diffing and Merging Node GraphsACM Transactions on Graphics10.1145/361834342:6(1-12)Online publication date: 5-Dec-2023
  • (2023)Concept Decomposition for Visual Exploration and InspirationACM Transactions on Graphics10.1145/361831542:6(1-13)Online publication date: 5-Dec-2023
  • (2023)VRGit: A Version Control System for Collaborative Content Creation in Virtual RealityProceedings of the 2023 CHI Conference on Human Factors in Computing Systems10.1145/3544548.3581136(1-14)Online publication date: 19-Apr-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics
ACM Transactions on Graphics  Volume 32, Issue 4
July 2013
1215 pages
ISSN:0730-0301
EISSN:1557-7368
DOI:10.1145/2461912
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2013
Published in TOG Volume 32, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. diff and merge
  2. geometry
  3. polygonal modeling
  4. visualization

Qualifiers

  • Research-article

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)55
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)NodeGit: Diffing and Merging Node GraphsACM Transactions on Graphics10.1145/361834342:6(1-12)Online publication date: 5-Dec-2023
  • (2023)Concept Decomposition for Visual Exploration and InspirationACM Transactions on Graphics10.1145/361831542:6(1-13)Online publication date: 5-Dec-2023
  • (2023)VRGit: A Version Control System for Collaborative Content Creation in Virtual RealityProceedings of the 2023 CHI Conference on Human Factors in Computing Systems10.1145/3544548.3581136(1-14)Online publication date: 19-Apr-2023
  • (2023)Comparing Screen-Based Version Control to Augmented Artifact Version Control for Physical ObjectsHuman-Computer Interaction – INTERACT 202310.1007/978-3-031-42280-5_25(391-415)Online publication date: 25-Aug-2023
  • (2022)Tangible Version Control: Exploring a Physical Object’s Alternative VersionsExtended Abstracts of the 2022 CHI Conference on Human Factors in Computing Systems10.1145/3491101.3519686(1-7)Online publication date: 27-Apr-2022
  • (2021)MeshChain: Secure 3D Model and Intellectual Property management Powered by Blockchain TechnologyAdvances in Computer Graphics10.1007/978-3-030-89029-2_40(519-534)Online publication date: 11-Oct-2021
  • (2020)Constant delay enumeration for conjunctive queriesACM SIGLOG News10.1145/3385634.33856367:1(4-33)Online publication date: 24-Feb-2020
  • (2020)TuningInteractions10.1145/338189727:2(48-53)Online publication date: 25-Feb-2020
  • (2020)Toward insourcing-measurement in inbodied interaction designInteractions10.1145/338134027:2(56-60)Online publication date: 25-Feb-2020
  • (2020)Toward growable computer gamesInteractions10.1145/337856327:2(82-85)Online publication date: 25-Feb-2020
  • Show More Cited By

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media