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

Mr. Dubey • 52.26K Points
Coach

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

(A) chan’s algorithm

(B) kirkpatrick-seidel algorithm

(D) jarvis algorithm

Correct : Option (B)

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

Discusssion

Related MCQs

Q. Which of them is type of Cipher?

Q. Crossover is used to _______.

Q. What is the port number for HTTP?

Q. An act of protecting information from unauthorised disclouser to an entity.-

Q. Structured Analysis is based on the principle of Bottom-Up Approach.

Q. Which is the largest computer?

Q. Publishing an application’s data as a REST service requires.

Q. A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order

Q. The different classes of relations created by the technique for preventing modification anomalies are called:

Q. Which of the following Error Detection checks is not a part of Application detection?