A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination.
Wm. Randolph FranklinVarol AkmanPublished in: Comput. Graph. Forum (1987)
Keyphrases
- single pass
- computationally efficient
- matching algorithm
- learning algorithm
- pruning strategy
- optimal solution
- highly efficient
- high accuracy
- objective function
- theoretical analysis
- dynamic programming
- np hard
- search space
- computational complexity
- multi objective
- k means
- simulated annealing
- preprocessing
- segmentation algorithm
- detection algorithm
- improved algorithm
- line detection
- computationally intensive
- high efficiency
- provably correct
- convex hull
- document images
- optimization algorithm
- particle filter
- worst case
- input image
- experimental evaluation
- hidden markov models
- association rules