c++代碼求點集的外包多邊形

https://www.geeksforgeeks.org/convex-hull-set-1-jarviss-algorithm-or-wrapping/ 這個方法很不錯，可以看看   We strongly recommend to see the following post first. How to check if two given line segments intersect?

>>阅读原文<<