Optimal Area Algorithm for Planar Polyline Drawings.
Nicolas BonichonBertrand Le SaëcMohamed MosbahPublished in: WG (2002)
Keyphrases
- optimal solution
- preprocessing
- dynamic programming
- worst case
- learning algorithm
- exhaustive search
- cost function
- recognition algorithm
- simulated annealing
- space complexity
- improved algorithm
- high accuracy
- computational complexity
- expectation maximization
- computationally efficient
- convex hull
- mobile robot
- experimental evaluation
- segmentation algorithm
- detection algorithm
- tree structure
- times faster
- np hard
- line drawings
- k means
- objective function