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) .

2DBall\2DBall.sln
......\2DBall.vcproj
......\水平序的凸包.cpp
2DBall

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．