A convex polygon is a polygon with the property that any line segment whoseendpoints are
Chapter 10, Problem 10.52(choose chapter or problem)
A convex polygon is a polygon with the property that any line segment whoseendpoints are on the polygon lies entirely within the polygon. The convex hull problem consists of finding the smallest (area) convex polygon that encloses a setof points in the plane. Figure 10.79 shows the convex hull for a set of 40 points.Give an O(N logN) algorithm to find the convex hull
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer