Avoiding the Global Sort: A Faster Contour Tree Algorithm

@inproceedings{Raichel2016AvoidingTG,
  title={Avoiding the Global Sort: A Faster Contour Tree Algorithm},
  author={Benjamin Raichel and Seshadhri Comandur},
  booktitle={Symposium on Computational Geometry},
  year={2016}
}
We revisit the classical problem of computing the contour tree of a scalar field f:M to R, where M is a triangulated simplicial mesh in R^d. The contour tree is a fundamental topological structure that tracks the evolution of level sets of f and has numerous applications in data analysis and visualization. All existing algorithms begin with a global sort of at least all critical values of f, which can require (roughly) Omega(n log n) time. Existing lower bounds show that there are… CONTINUE READING

Topics from this paper.