Which of the following areas do closest pair problem arise?
(a) computational geometry
(b) graph colouring problems
(c) numerical problems
(d) string matching
I have been asked this question during an online exam.
This intriguing question comes from Computational Geometry in section Computational Geometry of Data Structures & Algorithms II