Shortest path around There is a fenced area in the two-dimensional Euclidean plane in the shape of a convex polygon with vertices at points p1(x1, y1), p2(x2, y2), . . . , pn(xn, yn) (not necessarily in this order). There are two more points, a(xa, ya) and b(xb, yb) such that xa < min{x1, x2, . . . , xn } and xb > max{x1, x2, . . . , xn }. Design a reasonably efficient algorithm for computing the length of the shortest path between a and b. [ORo98]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.