Description: The 2D convex hull algorithm, 1. Sorting easier, just a simple comparison, there is no operation. 2. To find a better starting point, that is sort of a point after the first. 3. Can be a good deal with exceptional circumstances (of line) .
To Search:
File list (Check if you may need any files):
2DBall\2DBall.sln
......\2DBall.vcproj
......\水平序的凸包.cpp
2DBall
Download