A polygon p is simple if its edges are non-intersecting. answer the following questions regarding simple polygons: (a) given a polygon p as a linked-list of the its vertices in counter-clockwise order. design an e!cient algorithm to determine if p is simple. (b) given a simple polygon p as a linked list of its vertices in counter-clockwise order. design an e!cient algorithm to find the convex hull of p.
Answers
Answered by
1
Uhusbsbujj. Isjbdbd. Nosjbd d
Similar questions