An Algorithm for Determining an Opaque Minimal Forest of a Convex Polygon.
Varol AkmanPublished in: Inf. Process. Lett. (1987)
Keyphrases
- convex hull
- detection algorithm
- learning algorithm
- globally optimal
- times faster
- preprocessing
- experimental evaluation
- computational complexity
- k means
- matching algorithm
- simulated annealing
- high accuracy
- linear programming
- optimal solution
- classification algorithm
- dynamic programming
- cost function
- worst case
- probabilistic model
- computational cost
- level set
- computationally efficient
- theoretical analysis
- segmentation algorithm
- mobile robot
- data structure
- significant improvement
- piecewise linear
- neural network