hello to all .
I need to do a project about convexHull algorithms in web Service [WİTH C#].
Algorithm names here :
•Gift wrapping aka Jarvis march :
One of the simplest (although not the most time efficient in the worst case) planar algorithms. Discovered independently by Chand & Kapur in 1970 and R. A. Jarvis in 1973. It has O(nh) time complexity, where n is the number of points in the set, and h is the number of points in the hull. In the worst case the complexity is Θ(n2).
•Graham scan :
A slightly more sophisticated, but much more efficient algorithm, published by Ronald Graham in 1972. If the points are already sorted by one of the coordinates or by the angle to a fixed vector, then the algorithm takes O(n) time.
İf anyone help it will be great for me . Thank you all .