.png){kind=icon}
Return
NodeGit: Diffing and Merging Node Graphs
.png){kind=icon}
PRE
AI
DOI：10.1145/3618343.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The use of version control is pervasive in collaborative software projects. Version control systems are based on two primary operations: diffing two versions to compute the change between them and merging two versions edited concurrently. Recent works provide solutions to diff and merge graphics assets such as images, meshes and scenes. In this work, we present a practical algorithm to diff and merge procedural programs written as node graphs. To obtain more precise diffs, we version the graphs directly rather than their textual representations. Diffing graphs is equivalent to computing the graph edit distance, which is known to be computationally infeasible. Following prior work, we propose an approximate algorithm tailored to our problem domain. We validate the proposed algorithm by applying it both to manual edits and to a large set of randomized modifications of procedural shapes and materials. We compared our method with existing state-of-the-art algorithms, showing that our approach is the only one that reliably detects user edits.
Keywords:
Version control
Procedural node graphs
Journal
IF:
9.5
Papers:
4.7K
Citations:
3.6W
Organization
Cited Papers
Use of Biomarkers to Improve 28-Day Mortality Stratification in Patients with Sepsis and SOFA≤6.png)
OAAI
IF0
OAAIShareSave
ShareSaveShareSaveThe Tumor Microenvironment in Classic Hodgkin’s Lymphoma in Responder and No-Responder Patients to First Line ABVD TherapyCancersOAAI
CancersIF0
OAAIShareSave
View more