4 ms·
Finding the convex hull of a collection of points is a studied problem, so you can use an existing solution: http://en.wikipedia.org/wiki/Convex_hull_algorithm
by redxaxder 15y ago
Finding the convex hull of a collection of points is a studied problem, so you can use an existing solution:
http://en.wikipedia.org/wiki/Convex_hull_algorithms http://en.wikipedia.org/wiki/Convex_hull_algorithms
Alternatively, willvarfar's approach is faster for large n, but the polygon won't be as pretty.
- iambot 15y agothank you, I appreciated you taking the time to answer. As with other comments on this thead, this is exactly the info I was looking for.