Avoiding the Global Sort: A Faster Contour Tree Algorithm.
Benjamin RaichelC. SeshadhriPublished in: Discret. Comput. Geom. (2017)
Keyphrases
- tree structure
- dynamic programming
- times faster
- learning algorithm
- cost function
- estimation algorithm
- high accuracy
- preprocessing
- k means
- significant improvement
- experimental evaluation
- expectation maximization
- matching algorithm
- binary tree
- spanning tree
- gradient information
- segmentation algorithm
- simulated annealing
- computational cost
- computational complexity
- delaunay triangulation
- tree construction
- computationally demanding
- contour tracking
- minimum spanning tree
- classification trees
- index structure
- detection algorithm
- markov random field
- worst case
- objective function