Although algorithms exist that construct the convex hull of a simple polygon in linear time and space, they are in fact not fast enough (except reference [6]) because they, at least in an explicit manner, fail to refer to the slope behavior of edges of the output polygon. Here we present an approach that requires no auxiliary stack and runs more efficiently due to its simpler operations if compared with most of the previous methods for the problem. Besides , its time performance is equivalent to that of reference [6].
展开▼
