Applying the improved Chen and Han's algorithm to different versions of shortest path problems on a polyhedral surface.
Shi-Qing XinGuo-Jin WangPublished in: Comput. Aided Des. (2010)
Keyphrases
- shortest path problem
- improved algorithm
- learning algorithm
- optimization algorithm
- computational cost
- dynamic programming
- cost function
- shortest path
- significant improvement
- search space
- expectation maximization
- computational complexity
- detection algorithm
- k means
- optimal solution
- surface reconstruction
- genetic algorithm
- single source
- recognition algorithm
- search strategies
- directed graph
- convex hull
- matching algorithm
- segmentation algorithm
- probabilistic model
- np hard