Properties of polynomial bases used in a line-surface intersection algorithm
Gun SrijuntongsiriStephen A. VavasisPublished in: CoRR (2007)
Keyphrases
- computational cost
- optimization algorithm
- optimal solution
- learning algorithm
- detection algorithm
- high accuracy
- experimental evaluation
- preprocessing
- k means
- worst case
- polynomially bounded
- clustering method
- segmentation algorithm
- np hard
- significant improvement
- computational complexity
- objective function
- similarity measure
- d objects
- dynamic programming
- particle swarm optimization
- line segments
- triangular mesh