Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
Cyril Höschl IVJan FlusserPublished in: Kybernetika (2019)
Keyphrases
- lower bound
- optimal solution
- worst case
- np hard
- objective function
- dynamic programming
- search space
- linear programming
- computational cost
- times faster
- optimal path
- high accuracy
- experimental evaluation
- convergence rate
- recognition algorithm
- detection algorithm
- cost function
- significant improvement
- k means
- optimality criterion
- wavelet packet
- globally optimal
- shape analysis
- decomposition method
- learning algorithm
- closed form
- clustering method
- optimization algorithm
- computationally efficient
- expectation maximization
- computational complexity
- multiscale