GrahamFindConvexHull

代码说明：

  寻找很多个点的最大包围线。通过扫描法，分成4个代码文件实现。最后附图给出前后结果。(Looking for maximum points surrounded by a lot of lines. By scanning method, divided into four code files to achieve. The results are given before and after the final drawings.)