Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal.
Andrey ProkopenkoDamien Lebrun-GrandiéPublished in: CoRR (2024)
Keyphrases
- preprocessing
- k means
- improved algorithm
- matching algorithm
- dynamic programming
- experimental evaluation
- single pass
- computational complexity
- detection algorithm
- np hard
- optimization algorithm
- learning algorithm
- tree structure
- cost function
- search space
- times faster
- high accuracy
- ant colony optimization
- clustering method
- theoretical analysis
- worst case
- upper bound
- probabilistic model
- computational cost
- objective function
- decision trees
- expectation maximization
- particle swarm optimization
- significant improvement
- memory requirements
- convergence rate
- recognition algorithm
- multiscale
- hardware implementation