Avoiding the Global Sort: A Faster Contour Tree Algorithm

摘要

AbstractWe revisit the classical problem of computing thecontour treeof a scalar field$$f:mathbb {M}ightarrow mathbb {R}$$f:M→R, where$$mathbb {M}$$Mis a triangulation of a ball in$$mathbb {R}^d$$Rd. The contour tree is a fundamental topological structure that tracks the evolution of level sets offand has numerous applications in data analysis and visualization. All existing algorithms begin with a global sort of at least all critical values off, which can require (roughly)展开▼