An Algorithm and Its Accoomplishment for Producting Minimum Set of Comvex Hull from Polygon
Kong Xiao-li · Journal of Chengde Petroleum College · 2003
The special characters of convex hull decide its special status in computational theory and computer graphics,whereas what we touch upon in reality is far more often polygon than convex hull.This paper presents an algorithm with which we can find minimum set of convex hull,in other word,using minimum of line to cut the polygon into several convex hull.Meanwhile,we can give out the data structure and the procedure.