An Improved Algorithm of Simple Polygon Convex Hull
Chen Xue-gong · Jisuanji gongcheng · 2007
Convex hull problem is one of the fundamental problems in computational geometry,and is used in many fields.Reference[4] presents an algorithm for finding the convex hull of a simple polygon using active double line test.By presenting counter-examples,it proves that the algorithm could not adapt to all cases,and analyzes its shortcoming,proposes an improved algorithm.The improved algorithm completely solves self-intersection which linear algorithms do not solve,and the realization is simple.