Description: Question: has a number of points on the plane, and surrounded by the smallest of these points, surrounded by the length of algorithm: the classic convex hull algorithm, when attention to solving the most to do deal with the outer ring.
- [gram] - point set convex hull Gram scanning proc
- [convexhull] - mainly introduces the convex hull algori
- [tubaoTest] - convex hull algorithm for the realizatio
- [Convex_Hull] - Convex hull algorithm in VC6 achieved, t
- [POJ3322] - Question: mobile rectangular box to reac
- [CRC_c] - CRC realize the c language, compressed f
- [tubao] - Convex hull of visual programming, inter
- [ACM_Code] - Include computational geometry, special
- [melkman] - Polygon melkman code for Convex Hull alg
- [2DBox] - Graphic description of contours bounding
File list (Check if you may need any files):
Download