5 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…
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…
Multi-field Visualization: Trait design and trait-induced merge trees
Danhua Lei, Jochen Jankowai, Petar Hristov +4
Feature level sets (FLS) have shown significant potential in the analysis of multi-field data by using traits defined in attribute space to specify features in the domain. In this…