10 papers
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…
Temporal Tracking of Reeb-Space Sheets
Mohit Sharma, Petar Hristov, Talha Bin Masood +1
Time-varying bivariate fields arise in many scientific applications, where the relationship between two scalar quantities evolves over time. While topological methods such as merge…
Electronic structure and oxidation states in high-pressure synthesized isostructural CeCN and TbCN
Amanda Ehn, Florian Trybel, Talha Bin Masood +2
Understanding the behavior of 4 electrons in materials containing rare earth elements is one of the fundamental questions within condensed matter physics. In this work the elect…
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…