Fast algorithm for polygon decomposition.
Surendra NaharSartaj K. SahniPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1988)
Keyphrases
- experimental evaluation
- detection algorithm
- learning algorithm
- objective function
- times faster
- np hard
- dynamic programming
- optimization algorithm
- single pass
- improved algorithm
- preprocessing
- significant improvement
- computational cost
- polygonal approximation
- data sets
- theoretical analysis
- cost function
- computational complexity
- simulated annealing
- linear programming
- input data
- high accuracy
- probabilistic model
- clustering method
- search space
- convex hull
- selection algorithm
- optimal solution
- similarity measure