On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n.
Sergey KorotovÁngel PlazaJosé P. SuárezPublished in: Comput. Aided Geom. Des. (2015)
Keyphrases
- detection algorithm
- learning algorithm
- times faster
- preprocessing
- dynamic programming
- high accuracy
- expectation maximization
- improved algorithm
- search space
- optimization algorithm
- objective function
- similarity measure
- significant improvement
- np hard
- computationally efficient
- optimal solution
- theoretical analysis
- input data
- worst case
- undirected graph
- cost function
- computational complexity
- maximum number
- gray value
- clustering method
- probabilistic model
- k means
- decision trees