YoVDO

Scalable Computation of the Extremum Graph

Offered By: Applied Algebraic Topology Network via YouTube

Tags

Computational Topology Courses Computer Graphics Courses Parallel Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Vijay Natarajan (08/02/23): Scalable Computation of the Extremum Graph


Taught by

Applied Algebraic Topology Network

Related Courses

Bradley Nelson: Parameterized Vietoris-Rips Filtrations via Covers
Applied Algebraic Topology Network via YouTube Geometry and Topology of Periodic Point Sets, for Example Crystals
Applied Algebraic Topology Network via YouTube Dimensionality Reduction via Distributed Persistence - DIPOLE
Applied Algebraic Topology Network via YouTube Embeddings and Tverberg-Type Problems: New Algorithms and Undecidability Results
Applied Algebraic Topology Network via YouTube Pawel Dlotko - A Few Simple Stories on Topology in Action
Applied Algebraic Topology Network via YouTube