BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Vijay Natarajan (Indian Institute of Science\, Bangalore) DTSTART:20200911T050000Z DTEND:20200911T060000Z DTSTAMP:20260423T004037Z UID:APATG/7 DESCRIPTION:Title: Ed it Distance between Merge Trees.\nby Vijay Natarajan (Indian Institute of Science\, Bangalore) as part of Asia Pacific Seminar on Applied Topolo gy and Geometry\n\n\nAbstract\nA merge tree captures the topology of sub-l evel and super-level sets of a scalar function. Topological structures suc h as the merge tree provide an abstract and succinct representation of sci entific data available as a static or time-varying scalar function. They f acilitate effective visualization and interactive exploration of feature-r ich data. Comparative tasks such as visual identification of correspondenc e between features in the data or locating key events require a feature-aw are comparison measure between scalar functions. We present an approach ba sed on tree edit distance to compare merge trees. The comparison measure s atisfies metric properties\, it can be computed efficiently\, and the cost model for the edit operations is both intuitive and captures well-known p roperties of merge trees. I will introduce the distance measure\, outline an algorithm for computing the measure\, and describe how the edit distanc e supports feature-driven analysis and visualization of time-varying scala r functions from CFD and 3D cryo electron microscopy data. [https://vgl.cs a.iisc.ac.in/pub/paper.php?pid=057]\n LOCATION:https://researchseminars.org/talk/APATG/7/ END:VEVENT END:VCALENDAR