reeb.ReebGraphImplSubSup

reeb.ReebGraphImplSubSup(self, geometry, threshold, verbosity=0)

Computes a Reeb graph by merging sub-level and super-level merge trees extracted from a given geometry. This implementation constructs the merge trees based on a specified threshold and then combines them to capture the topological features of the data. The computation is modularized into distinct steps, which allows for alternative methods to be employed if desired.

For a detailed discussion of the algorithm and design choices, please refer to our paper.