McqMate

Q. |
## Which of the following is called the “ultimate planar convex hull algorithm”? |

A. | chan’s algorithm |

B. | kirkpatrick-seidel algorithm |

C. | gift wrapping algorithm |

D. | jarvis 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). |

882

0

Do you find this helpful?

2

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the average case complexity of a quick hull algorithm?
- The quick hull algorithm runs faster if the input uses non- extreme points.
- Who formulated quick hull algorithm?
- Which complete graph is not present in minor of Outer Planar Graph?
- To which type of problems does quick hull belong to?
- The time is taken to find the ‘n’ points that lie in a convex quadrilateral is?
- What is the other name for quick hull problem?
- How many approaches can be applied to solve quick hull problem?
- What is the worst case complexity of quick hull?
- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?