I have a question. I want to solve the problem with the following conditions.
- The given data are two-dimensional x, y coordinate data.
- I'd like to include all this data as a circle (two circles can contain one point in duplicate)
- The radius of the circle is fixed.
- 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.