Triplet Merge Trees

DOI10.1007/978-3-030-43036-8_2zbMath1465.68061OpenAlexW3113202345MaRDI QIDQ5147726

No author found.

Publication date: 28 January 2021

Published in: Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43036-8_2

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10) Data structures (68P05) Computational aspects of digital topology (68U03)

Related Items (1)

Using extremal events to characterize noisy time series

Cites Work

• Unnamed Item
• Unnamed Item
• Computing contour trees in all dimensions
• Parallel computation of the topology of level sets
• The TOPORRERY: computation and presentation of multi-resolution topology
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history

This page was built for publication: Triplet Merge Trees