BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
X-LIC-LOCATION:Australia/Melbourne
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19721003T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19721003T020000
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240214T070250Z
LOCATION:Meeting Room C4.11\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231215T113000
DTEND;TZID=Australia/Melbourne:20231215T114500
UID:siggraphasia_SIGGRAPH Asia 2023_sess136_papers_347@linklings.com
SUMMARY:NodeGit: Diffing and Merging Node Graphs
DESCRIPTION:Technical Papers\n\nEduardo Rinaldi (Ubisoft), Davide Sforza (
 Sapienza University of Rome), and Fabio Pellacini (University of Modena an
 d Reggio Emilia)\n\nThe use of version control is pervasive in collaborati
 ve software projects. Version control systems are based on two primary ope
 rations: diffing two versions to compute the change between them and mergi
 ng two versions edited concurrently. Recent works provide solutions to dif
 f and merge graphics assets such as images, meshes and scenes. In this wor
 k, we present a practical algorithm to diff and merge procedural programs 
 written as node graphs. To obtain more precise diffs, we version the graph
 s directly rather than their textual representations. Diffing graphs is eq
 uivalent to computing the graph edit distance, which is known to be comput
 ationally infeasible. Following prior work, we propose an approximate algo
 rithm tailored to our problem domain. We validate the proposed algorithm b
 y applying it both to manual edits and to a large set of randomized modifi
 cations of procedural shapes and materials. We compared our method with ex
 isting state-of-the-art algorithms, showing that our approach is the only 
 one that reliably detects user edits.\n\nRegistration Category: Full Acces
 s\n\nSession Chair: Bo Ren (TMCC, Nankai University)
URL:https://asia.siggraph.org/2023/full-program?id=papers_347&sess=sess136
END:VEVENT
END:VCALENDAR