An Efficient Algorithm for the Three-Dimensional Diameter Problem.
Sergei BespamyatnikhPublished in: Discret. Comput. Geom. (2001)
Keyphrases
- experimental evaluation
- three dimensional
- theoretical analysis
- computational cost
- dynamic programming
- times faster
- expectation maximization
- learning algorithm
- selection algorithm
- np hard
- preprocessing
- high accuracy
- computational complexity
- improved algorithm
- path planning
- classification algorithm
- simulated annealing
- particle swarm optimization
- optimal solution
- computationally efficient
- segmentation algorithm
- detection algorithm
- convex hull
- recognition algorithm
- linear programming
- highly efficient
- single pass
- ant colony optimization
- worst case
- d objects
- mobile robot
- k means
- feature selection