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

💬 Discuss

✅ Correct 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).

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

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

💬 Discussion

📊 Question Analytics

👁️

118

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate

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

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics