177 citations · 339 across the 25 of their papers we have counts for
8 papers · 1 filter
Exact Computation of Trait-induced Merge Trees for Bivariate Fields
Petar Hristov, Ingrid Hotz, Talha Bin Masood
Trait-induced merge trees (TIMTs) provide a robust topology-based method for selecting and browsing feature level sets in multivariate data by analyzing the distance field induced…
Towards Computing Average Merge Tree Based on the Interleaving Distance
Elena Farahbakhsh Touli, Ingrid Hotz, Talha Bin Masood
The interleaving distance is a key tool for comparing merge trees, which provide topological summaries of scalar functions. In this work, we define an average merge tree for a pair…
Singular Arrange and Traverse Algorithm for Computing Reeb Spaces of Bivariate PL Maps
Petar Hristov, Ingrid Hotz, Talha Bin Masood
We present an exact and efficient algorithm for computing the Reeb space of a bivariate PL map. The Reeb space is a topological structure that generalizes the Reeb graph to the set…
Robust Geometric Predicates for Bivariate Computational Topology
Petar Hristov, Ingrid Hotz, Talha Bin Masood
We present theory and practice for robust implementations of bivariate Jacobi set and Reeb space algorithms. Robustness is a fundamental topic in computational geometry that deals…
Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
Elena Farahbakhsh Touli, Talha Bin Masood
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization…
Keeping it sparse: Computing Persistent Homology revisited
Ulrich Bauer, Talha Bin Masood, Barbara Giunti +3
In this work, we study several variants of matrix reduction via Gaussian elimination that try to keep the reduced matrix sparse. The motivation comes from the growing field of topo…
Edit Distance between Merge Trees
Raghavendra Sridharamurthy, Talha Bin Masood, Adhitya Kamakshidasan +1
Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration…
Approximation Algorithms for Max-Morse Matching
Abhishek Rathod, Talha Bin Masood, Vijay Natarajan
In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation alg…