An Efficient Algorithm for Determining an Aesthetic Shape Connecting Unorganized 2D Points.
Stefan OhrhallingerSudhir P. MudurPublished in: Comput. Graph. Forum (2013)
Keyphrases
- cost function
- dynamic programming
- np hard
- detection algorithm
- computational complexity
- preprocessing
- computational cost
- delaunay triangulation
- learning algorithm
- objective function
- polygonal approximation
- matching algorithm
- prior information
- geodesic distance
- optimization algorithm
- sample points
- ellipse fitting
- medial axis
- convex hull
- worst case
- k means
- similarity measure