7 citations · 20 across the 20 of their papers we have counts for
33 papers
Parametric Shortest Paths in a Linearly Interpolated Graph
Jacob Sriraman, Eli Barton, Brittany Terese Fasy +6
We consider the parametric shortest paths problem in a linearly interpolated graph. Given two positively-weighted directed graphs and the linearly…
Too Many or Too Few? Sampling Bounds for Topological Descriptors
Brittany Terese Fasy, Maksym Makarchuk, Samuel Micka +1
Topological descriptors, such as the Euler characteristic function and the persistence diagram, have grown increasingly popular for representing complex data. Recent work showed th…
Tensor Computation of Euler Characteristic Functions and Transforms
Jessi Cisewski-Kehe, Brittany Terese Fasy, Alexander McCleary +1
The weighted Euler characteristic transform (WECT) and Euler characteristic function (ECF) have proven to be useful tools in a variety of applications. However, current methods for…
Drawing Reeb Graphs
Erin Chambers, Brittany Terese Fasy, Erfan Hosseini Sereshgi +1
Reeb graphs are simple topological descriptors with applications in many areas like topological data analysis and computational geometry. Despite their prevalence, visualization of…
Gromov-Hausdorff Distance for Directed Spaces
Lisbeth Fajstrup, Brittany Terese Fasy, Wenwen Li +4
The Gromov-Hausdorff distance measures the similarity between two metric spaces by isometrically embedding them into an ambient metric space. We introduce an analogue of this dista…
Rapid and Precise Topological Comparison with Merge Tree Neural Networks
Yu Qin, Brittany Terese Fasy, Carola Wenk +1
Merge trees are a valuable tool in the scientific visualization of scalar fields; however, current methods for merge tree comparisons are computationally expensive, primarily due t…