Triangulating Multiply-Connected Polygons: a Simple, yet Efficient Algorithm.
Rémi RonfardJarek RossignacPublished in: Comput. Graph. Forum (1994)
Keyphrases
- learning algorithm
- computationally efficient
- single pass
- classification algorithm
- k means
- high efficiency
- matching algorithm
- times faster
- detection algorithm
- optimization algorithm
- segmentation algorithm
- probabilistic model
- computational cost
- dynamic programming
- cost function
- computational complexity
- computationally intensive
- recognition algorithm
- memory efficient
- provably correct
- tree structure
- motion estimation
- similarity measure
- path planning
- binary images
- improved algorithm
- highly efficient
- high accuracy
- worst case
- straight forward
- decision trees