CODEWITHSUNDEEP
pythonmathset-cover
Yonghyeon
Yonghyeon

Reputation: 1

Optimizing Circle Coverage for Two-Dimensional Data Points

I have a question. I want to solve the problem with the following conditions.

  1. The given data are two-dimensional x, y coordinate data.
  2. I'd like to include all this data as a circle (two circles can contain one point in duplicate)
  3. The radius of the circle is fixed.
  4. The circle should be used to a minimum.

Can I know any programming techniques or algorithms related to this?

I've been Googling, I've been using greed algorithms or heuristic algorithms.

Upvotes: 0

Views: 88

Answers (0)

Related Questions