Fast Algorithm for Polygon Clipping with 3D Windows.
Andreas BurkertStefan NollPublished in: Eurographics (1988)
Keyphrases
- single pass
- times faster
- computational complexity
- convex hull
- learning algorithm
- improved algorithm
- search space
- dynamic programming
- experimental evaluation
- expectation maximization
- k means
- cost function
- detection algorithm
- high accuracy
- worst case
- matching algorithm
- linear programming
- simulated annealing
- probabilistic model
- np hard
- data sets
- operating system
- optimization algorithm
- computational cost
- tree structure
- significant improvement
- objective function
- convergence rate
- recognition algorithm
- genetic algorithm
- neural network