8 citations · 8 across the 3 of their papers we have counts for
4 papers
EXaCTz: Guaranteed Extremum Graph and Contour Tree Preservation for Distributed- and GPU-Parallel Lossy Compression
Yuxiao Li, Mingze Xia, Xin Liang +2
This paper introduces EXaCTz, a parallel algorithm that corrects lossy-compressed scalar field data to preserve extremum graphs and contour trees concurrently. While error-bounded…
Fast Topology-Aware Lossy Data Compression with Full Preservation of Critical Points and Local Order
Alex Fallin, Nathaniel Gorski, Tripti Agarwal +3
Many scientific codes and instruments generate large amounts of floating-point data at high rates that must be compressed before they can be stored. Typically, only lossy compressi…
Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
Weiran Lyu, Raghavendra Sridharamurthy, Jeff M. Phillips +1
Scalar field comparison is a fundamental task in scientific visualization. In topological data analysis, we compare topological descriptors of scalar fields -- such as persistence…
Measure Theoretic Reeb Graphs and Reeb Spaces
Qingsong Wang, Guanqun Ma, Raghavendra Sridharamurthy +1
A Reeb graph is a graphical representation of a scalar function on a topological space that encodes the topology of the level sets. A Reeb space is a generalization of the Reeb gra…