An accelerating algorithm for computing convex hull of simple polygon
Zhou Wenke · Journal of Guangzhou University · 2003
This paper focuses on an accelerating algorithm for computing convex hulls of s-polygon, which, at first, arranges all given points according to angle between X-axis and themselves, deletes gradually concave points. We get convex hulls of s-polygon, moreover, and we describe the data-structure of algorithm in details in the paper. Its time-complexity, in theory, is O(nlogn).