Question: There are 5m,m is an integer >=1, points in the plane, no three of them on the same line. Design an efficient divide and conquer

There are 5m,m is an integer >=1, points in the plane, no three of them on the same line. Design an efficient divide and conquer algorithm to construct m pentagons with their vertices at these points. The pentagons need not be convex, but each of them must be simple, i.e., its boundary should not cross itself and no two pentagons may have a common point
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
