Jarvis March implemented in C#
Saturday, November 29, 2008 » programming, uni
This C# program was made for graphics programming course in 2008. The Jarvis March algorithm to find the convex hull
of a set of points in 2D. See 'Gift wrapping algorithm' for more details about working on wikipedia.
[ jarvis_march_source.zip ]
