PhD graduated
Team : APR
Departure date : 02/15/2019

Supervision : Julien TIERNY

Co-supervision : FORTIN Pierre, JOMIER Julien

High Performance Level-set based Topological Data Analysis

Topological Data Analysis requires efficient algorithms to deal with the continuously increasing size and level of details of data sets. In this manuscript, we focus on three fundamental topological abstractions based on level sets: merge trees, contour trees and Reeb graphs. We propose three new efficient parallel algorithms for the computation of these abstractions on multi-core shared memory workstations. The first algorithm developed in the context of this thesis is based on multi-thread parallelism for the contour tree computation. A second algorithm revisits the reference sequential algorithm to compute this abstraction and is based on local propagations expressible as parallel tasks. This new algorithm is in practice twice faster in sequential than the reference algorithm designed in 2000 and offers one order of magnitude speedups in parallel. A last algorithm also relying on task-based local propagations is presented, computing a more generic abstraction: the Reeb graph. Contrary to concurrent approaches, these methods provide the augmented version of these structures, hence enabling the full extend of level-set based analysis. Algorithms presented in this manuscript result today in the fastest implementations available to compute these abstractions. This work has been integrated into the open-source platform: the Topology Toolkit (TTK).

Defence : 02/15/2019

Jury members :

M. GARTH Christoph (University of Kaiserslautern) [rapporteur]
M. RAFFIN Bruno (INRIA Grenoble) [rapporteur]
Mme. CHAINE Raphaëlle (Université de Lyon)
M. NAMYST Raymond (Université de Bordeaux)
M. SENS Pierre (Sorbonne Université)
M. FORTIN Pierre (Sorbonne Université)
M. JOMIER Julien (Kitware)
M. TIERNY Julien (CNRS, Sorbonne Université)

Departure date : 02/15/2019

2016-2023 Publications

Mentions légales
Site map