A new method of evaluating compact geometric bounds for use in subdivision algorithms.
Sankarappan GopalsamyDilip KhandekarSudhir P. MudurPublished in: Comput. Aided Geom. Des. (1991)
Keyphrases
- theoretical analysis
- computationally efficient
- computational cost
- recently developed
- computational complexity
- significant improvement
- computational efficiency
- pairwise
- detection method
- edge detection
- objective function
- worst case
- dynamic programming
- cost function
- preprocessing
- learning algorithm
- simulated annealing
- probabilistic model
- clustering method
- search methods
- lower and upper bounds