Description: This is a convex hull of the procedure, a number of points, find a few points all the points are wrapped, as the same convex polygon.
To Search:
- [Two] - Two dimensional convex hull, the difficu
- [MinvexCore] - I have students write a minimum convex h
- [hysthresh] - Maxima suppression and dual-threshold th
- [IO] - Realize this procedure in the use of ord
- [migong] - Labyrinth function, enter the maze, run
- [melkman] - Polygon melkman code for Convex Hull alg
File list (Check if you may need any files):