Which of the following is called the “ultimate planar convex hull algorithm”?
|C.||gift wrapping algorithm|
|Answer» B. kirkpatrick-seidel algorithm|
|Explanation: kirkpatrick-seidel algorithm is called as the ultimate planar convex hull algorithm. its running time is the same as that of chan’s algorithm (i.e.) o(n log h).|
Login to Continue
It will take less than 2 minutes