Avoiding the Global Sort: A Faster Contour Tree Algorithm.
Benjamin RaichelC. SeshadhriPublished in: SoCG (2016)
Keyphrases
- times faster
- learning algorithm
- preprocessing
- minimum spanning tree
- dynamic programming
- experimental evaluation
- objective function
- np hard
- detection algorithm
- optimization algorithm
- computationally demanding
- recognition algorithm
- b tree
- tree structure
- expectation maximization
- particle swarm optimization
- high accuracy
- k means
- computational complexity
- worst case
- computational cost
- global consistency
- tree construction