___________ is a method of constructing a smallest polygon out of n given points.
(a) closest pair problem
(b) quick hull problem
(c) path compression
(d) union-by-rank
The question was posed to me in an international level competition.
My doubt stems from Computational Geometry in chapter Computational Geometry of Data Structures & Algorithms II