Click here to Skip to main content
11,702,130 members (62,374 online)
Rate this: bad
Please Sign up or sign in to vote.
See more: C# ASP ASP.NET SQL graphics service , +
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 .
Posted 3-Jan-12 3:10am
Edited 3-Jan-12 3:50am
Rate this: bad
Please Sign up or sign in to vote.

Solution 1

Best reference is available at CodeProject: Convex Hull[^]
Rate this: bad
Please Sign up or sign in to vote.

Solution 2

Maybe also a starting point (3D):[^]


This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
0 Maciej Los 395
1 Sergey Alexandrovich Kryukov 355
2 OriginalGriff 314
3 CHill60 145
4 Mika Wendelius 119
0 OriginalGriff 8,344
1 Sergey Alexandrovich Kryukov 7,507
2 CPallini 4,922
3 Maciej Los 4,371
4 Mika Wendelius 3,556

Advertise | Privacy | Mobile
Web04 | 2.8.150819.1 | Last Updated 3 Jan 2012
Copyright © CodeProject, 1999-2015
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100