Kitware Gets Ready for LDAV 2016 Presentation on New Algorithm

In the context of research staff Charles Gueunet’s doctoral thesis, Kitware and the Laboratory of Computer Science, Paris 6 (LIP6), have worked on a new algorithm to efficiently compute the contour tree on tetrahedral meshes. Gueunet (Kitware and LIP6) co-authored a paper on this shared-memory multi-threaded algorithm with Pierre Fortin (LIP6), Julien Jomier (Kitware), and Julien Tierny (LIP6). The paper has been accepted for presentation at The 6th IEEE Symposium on Large Data Analysis and Visualization (LDAV 2016), which will take place in conjunction with IEEE VIS on October 23, 2016, in Baltimore, Maryland.

For those interested in learning more about the work before the symposium, here is the abstract for the paper:

This paper presents a new algorithm for the fast, shared memory multi-threaded computation of contour trees on tetrahedral meshes. In contrast to previous multi-threaded algorithms, our technique computes the augmented contour tree. Such an augmentation is required to enable the full extent of contour tree based applications, including for instance data segmentation. Our approach relies on a range-driven domain partitioning. We show how to exploit such a partitioning to rapidly compute contour forests. We also show how such forests can be efficiently turned into the output contour tree. We report performance numbers that compare our approach to a reference sequential implementation for the computation of augmented contour trees. These experiments demonstrate the run-time efficiency of our approach. We demonstrate the utility of our approach with several data segmentation tasks. We also provide a lightweight VTK-based C++ implementation of our approach for reproduction purposes.

This work is supported by the French National Association for Research and Technology (ANRT).

We look forward to sharing more at the presentation!

Questions or comments are always welcome!