A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form.
Hanspeter BieriWalter NefPublished in: Computing (1985)
Keyphrases
- experimental evaluation
- significant improvement
- dynamic programming
- matching algorithm
- optimization algorithm
- computationally efficient
- high accuracy
- improved algorithm
- expectation maximization
- worst case
- k means
- computational complexity
- optimal solution
- data sets
- particle swarm optimization
- preprocessing
- segmentation algorithm
- detection algorithm
- times faster
- learning algorithm
- computational cost
- multi objective
- simulated annealing
- ant colony optimization