Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm.
Fajie LiReinhard KlettePublished in: PSIVT (2006)
Keyphrases
- simple polygon
- convex hull
- finding the shortest path
- computational complexity
- dynamic programming
- objective function
- segmentation algorithm
- computationally efficient
- particle swarm optimization
- feature selection
- endpoints
- learning algorithm
- d objects
- upper bound
- np hard
- shortest path
- high dimensional
- image segmentation
- image processing