2 papers
cs.CG2026
An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
Althaf P, Amit Chattopadhyay, Osamu Saeki
A merge tree is a fundamental topological structure used to capture the sub-level set (and similarly, super-level set) topology in scalar data analysis. The interleaving distance i…
cs.CG2026
An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
Amit Chattopadhyay, Yashwanth Ramamurthi, Osamu Saeki
The Reeb space is a fundamental data structure in computational topology that represents the fiber topology of a multi-field (or multiple scalar fields), extending the level set to…