Scalable Computation of the Extremum Graph

Explore the scalable computation of the extremum graph in this 48-minute lecture by Vijay Natarajan from the Applied Algebraic Topology Network. Delve into topological descriptors of scalar functions, including contour trees, Reeb graphs, merge trees, and Morse-Smale complexes, with a focus on the extremum graph as a simplified yet powerful abstraction. Discover its application in studying granular material ensembles and learn about efficient parallel algorithms for computing this descriptor. Gain insights into a library for scalable extremum graph computation that leverages GPU and CPU parallelism, handles large datasets, and extends to higher-dimensional data analysis.