A Sweep-Plane Algorithm for the Computation of the Volume of a Union of Polytopes.
Lovis AndersonBenjamin HillerPublished in: OR (2018)
Keyphrases
- improved algorithm
- detection algorithm
- experimental evaluation
- k means
- worst case
- convex hull
- theoretical analysis
- dynamic programming
- preprocessing
- computational complexity
- significant improvement
- learning algorithm
- np hard
- objective function
- times faster
- matching algorithm
- clustering method
- optimal solution
- cost function
- expectation maximization
- ant colony optimization
- markov random field
- computational cost
- convergence rate
- recognition algorithm
- image segmentation