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:20260114T163642Z
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:Eduardo Rinaldi (Ubisoft), Davide Sforza (Sapienza University 
 of Rome), and Fabio Pellacini (University of Modena and Reggio Emilia)\n\n
 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 edit
 ed concurrently. Recent works provide solutions to diff and merge graphics
  assets such as images, meshes and scenes. In this work, we present a prac
 tical algorithm to diff and merge procedural programs written as node grap
 hs. To obtain more precise diffs, we version the graphs directly rather th
 an their textual representations. Diffing graphs is equivalent to computin
 g the graph edit distance, which is known to be computationally infeasible
 . Following prior work, we propose an approximate algorithm tailored to ou
 r problem domain. We validate the proposed algorithm by applying it both t
 o manual edits and to a large set of randomized modifications of procedura
 l shapes and materials. We compared our method with existing state-of-the-
 art algorithms, showing that our approach is the only one that reliably de
 tects user edits.\n\nRegistration Category: Full Access\n\nSession Chair: 
 Bo Ren (TMCC, College of Computer Science, Nankai University)\n\n
URL:https://asia.siggraph.org/2023/full-program?id=papers_347&sess=sess136
END:VEVENT
END:VCALENDAR