Description: A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P.
One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.
To Search:
- [hull] - Convex hull algorithm and jarvis Geremi
File list (Check if you may need any files):
Planer convex hull
..................\chk.class
..................\chk.java
..................\convexhull.class
..................\convexhull.java
..................\CSL356-2005CS50225.pdf
..................\point.class
..................\Point.java
..................\qsort.java
Download