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
I had been asked this question in an interview for job.
This is a very interesting question from Computational Geometry in chapter Computational Geometry of Data Structures & Algorithms II