Description: Input: A set S of planar pointsOutput: A convex hull for SStep 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return.Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR. Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull (SL) and Hull (SR) respectively.Step 4: Apply the merging procedure to merge Hull (SL) and Hull (SR) together to form a convex hull. Time complexity: T (n) = 2T (n/2)+ O (n) = O (n log n)
- [convexhullalgorithm.Rar] - convex hull algorithm, scattered dots on
- [ConvexHull] - The use of C++ Realize the Graham scan m
- [convex] - Classic convex hull algorithm. JAVA lang
- [marchingcubes] - Java achieved by the marching cube
- [SS] - Algorithm for Sensor Selection via Conve
- [cvHull] - OpenCV package based on minimum convex b
- [SVT_2009-05-20] - This classic article Exact Matrix Comple
File list (Check if you may need any files):
convex hull
...........\convex hull.cpp
Download