Click here to Skip to main content
Rate this: bad
good
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 4:10am
Edited 3-Jan-12 4:50am
v2
Rate this: bad
good
Please Sign up or sign in to vote.

Solution 1

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

Solution 2

Maybe also a starting point (3D):
http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html[^]
 
Regards
  Permalink  

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

  Print Answers RSS
0 OriginalGriff 350
1 Jochen Arndt 150
2 Richard MacCutchan 135
3 PIEBALDconsult 110
4 Sergey Alexandrovich Kryukov 104
0 OriginalGriff 6,055
1 DamithSL 4,621
2 Maciej Los 4,087
3 Kornfeld Eliyahu Peter 3,500
4 Sergey Alexandrovich Kryukov 3,294


Advertise | Privacy | Mobile
Web01 | 2.8.141220.1 | Last Updated 3 Jan 2012
Copyright © CodeProject, 1999-2014
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