Question

Computational Geometry:

Let E be an unsorted set of n segments that are the edges of a convex polygon. Describe an O(nlogn) algorithm that computes from E a list containing all vertices of the polygon, sorted in clockwise order.

Don't copy other peoples wrong answer or you get down-voted.

Answer 1

Solution:

We have the set of all points of the polygonal shape In set E., that is unsorted to type within the clockwise direction
these points we've to divide the polnts Into 2 sets. for this, we've to search out min(X) and max(X) within the
set of points. If min(X) or max(X) are multiple then think about the min(X) that have less Y worth, consider
max(x) that have bigger Y worth. Then divide the set into 2 parts:

1. Points below the road connection min(X) and max(X). [ purpose with max(X) can be a part of this set]
2. Points on top of the road connection min(X) and max(X). [point with min(x) can be a part of this set ]

from thje above explantion we can see that the following task is to type these 2 set of points. type the primary set in descendant order per X
coordinate (If the worth of X is that the same then type like the Y coordinate value)

. Similarly,

by sorting the second set in ascending order as per X coordinate (if the worth of X is that the same then type
corresponding to the Y coordinate value)

.* it takes " O"(n logn) time to type all polnts exploitation
*merge or fast type (Standard perform in c++ take n (logn) time to type the list).
Now be a part of each sets and duplicate to line E. The set E currently sorted in clockwise order