A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron.
Katrin DobrindtKurt MehlhornMariette YvinecPublished in: WADS (1993)
Keyphrases
- convex hull
- single pass
- improved algorithm
- times faster
- significant improvement
- experimental evaluation
- globally optimal
- provably correct
- detection algorithm
- theoretical analysis
- expectation maximization
- worst case
- computationally efficient
- piecewise linear
- objective function
- dynamic programming
- high efficiency
- learning algorithm
- np hard
- cost function
- search space
- optimization algorithm
- preprocessing
- computational complexity
- recognition algorithm
- highly efficient
- particle swarm optimization
- computationally tractable
- simulated annealing
- high accuracy
- computational cost
- search algorithm
- optimal solution
- similarity measure