Блог пользователя xeronix

Автор xeronix, 12 лет назад, По-английски

I have solved closest pair and closest triplet problems using divide and conquer. I wonder if there is a problem ever asked which deals with finding closest quadruplet of points ( sum of distance between all pairs is minimum ) ? Also i want some efficient approach for solving similar problem for k-closest points.

  • Проголосовать: нравится
  • +3
  • Проголосовать: не нравится