A Linear Time BVH Construction Algorithm for Sparse Volumes.
Stefan ZellmannMatthias HellmannUlrich LangPublished in: PacificVis (2019)
Keyphrases
- worst case
- dynamic programming
- learning algorithm
- cost function
- np hard
- high accuracy
- improved algorithm
- optimal solution
- clustering method
- segmentation algorithm
- computationally efficient
- detection algorithm
- ant colony optimization
- objective function
- preprocessing
- image sequences
- times faster
- search space
- linear programming
- particle swarm optimization
- computational complexity
- theoretical guarantees
- data sets
- optimization algorithm
- markov random field
- upper bound
- computational cost
- experimental evaluation
- k means
- three dimensional
- image segmentation