We present a method for tracking regions defined by Merge trees in time-dependent scalar fields. We build upon a recent method that computes a directed acyclic graph (DAG) from local tracking information such as overlap and similarity, but tracks a region by solving a shortest path problem in the DAG. However, the existing method is only able to track one selected region. Tracking all regions is not straightforward: the naïve version, tracking regions one by one, is very slow. We present a fast method here that tracks all regions at once. We showcase speedups of up to two orders of magnitude.


List of all publications