problem consists of finding the smallest (area) convex polygon that encloses a set of points in the plan
e. Figure 10.79 shows the convex hull for a set of 40 points. Give an O(N logN) algorithm to find the convex hull. . -
|
10.52 A convex polygon is a polygon with the property that any line segment whose endpoints are on the polygon lies entirely within the polygon. The convex hull
problem consists of finding the smallest (are a) convex polygon that encloses a set of points in the plan e. Figure 10.79 shows the convex hull for a set of 40 points. Give an O(N logN) algorithm to find the convex hull. . - | |
| View Solution | |
| << Back | Next >> |