convex_hull_test

convex_hull_test, a MATLAB code which calls convex_hull(), which computes the convex hull of points.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Related Data and Programs:

convex_hull, a MATLAB code which computes the convex hull of a set of points.

Source Code:

• convex_hull_test.m, calls all the tests.
• convex_hull_test.sh, runs all the tests.
• convex_hull_test.txt, the output file.

EDDY is 20 points provided by William Eddy as a test case for his ACM TOMS Algorithm 523 for convex hulls.

• eddy_nodes.txt, the nodes.
• eddy_nodes.png
• eddy_hull.png

ELLIPSOID1 is 200 points that lie on an ellipse;

• ellipsoid1_nodes.txt, the nodes.
• ellipsoid1_nodes.png
• ellipsoid1_hull.png

ELLIPSOID2 is 1000 points that lie inside an ellipse.

• ellipsoid2_nodes.txt, the nodes.
• ellipsoid2_nodes.png
• ellipsoid2_hull.png

GRAHAM is 11 points used by O'Rourke in a discussion of Graham's algorithm:

• graham_nodes.txt, the nodes.
• graham_nodes.png
• graham_hull.png

HAND is 59 points that outline a hand.

• hand_nodes.txt, the nodes.
• hand_nodes.png
• hand_hull.png

KN57 is 57 points which represent city locations in a traveling salesman problem.

• kn57_nodes.txt, the nodes.
• kn57_nodes.png
• kn57_hull.png

STAR is 10 points which are the vertices of a star.

• star_nodes.txt, the nodes.
• star_nodes.png
• star_hull.png