@InCollection{saikia20,
  author    = {H.~Saikia and T.~Weinkauf},
  title     = {Fast Topology-based Feature Tracking using a Directed Acyclic Graph},
  booktitle = {Topological Methods in Data Analysis and Visualization V},
  publisher = {Springer},
  year      = {2020},
  editor    = {H.~Carr and I.~Fujishiro and F.~Sadlo and S.~Takahashi},
  series    = {Mathematics and Visualization},
  pages     = {155--169},
  isbn      = {978-3-030-43036-8},
  abstract  = {We present a method for tracking regions defined by Merge trees in time-dependent scalar fields. We build upon a recently published method that computes a directed acyclic graph (DAG) from local tracking information such as overlap and similarity, and tracks a single 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.},
  doi       = {https://doi.org/10.1007/978-3-030-43036-8_10},
  url = {http://tinoweinkauf.net/publications/abssaikia20.html},
}