PPP extensions: fully augmented contour tree, marching cubes connectivity, detailed timings
This merge request extends the current implementation of the contour tree (PPP1) to enable
the computation of the fully augmented contour tree. Previously, only the contour tree (without augmentation) was supported. While the augmentation using PPP1 is not efficient, it serves as a reference for comparison with the new PPP2 algorithm (see separate merge request).
the computation of the contour tree that is consistent with the interpolant assumed by the marching cubes algorithm
With these changes we can now compute the fully augmented contour tree (i.e., the contour tree including all regular vertices), which is critical to compute statistics and segmentations based on the contour tree.
This code was created as part of the ECP Alpine project.