Publications
Talk · International Conference for High Performance Computing, Networking, Storage and Analysis · November 7, 2019
Local-global merge tree computation with local exchanges
Arnur Nigmetov, Dmitriy Morozov
Abstract
A merge tree is a topological summary of a real-valued function on a graph. Merge trees can be used to find stable features in the data, report the number of connected components above any threshold, or compute other topological descriptors. A local-global merge tree provides a way of distributing a merge tree among multiple processors so that queries can be performed with minimal communication. While this makes them efficient in massively parallel setting, the only known algorithm for computing a local-global merge tree involves global reduction.
Topological and Geometric Data AnalysisComputer Graphics and Visualization TechniquesDigital Image Processing Techniquesmerge treeslocal exchangefunction graphs