c**********e
发帖数: 2007 | 1 N points (x_i, y_i) in a plane(3D space). find circle(sphere) containing
most points. complexity?
这是daj大牛的一道题目。有人知道怎么做吗？
It can be interpreted in 2 ways. Either given a number of points, such as K=
0.9*N, find the smallest circle, or give a radius R, find the largest
possible points. | z****g
发帖数: 1978 | 2 ...难道不是用0做圆心，max norm of points做半径么....又没说要求最小圆...
K=
【在 c**********e 的大作中提到】
: N points (x_i, y_i) in a plane(3D space). find circle(sphere) containing
: most points. complexity?
: 这是daj大牛的一道题目。有人知道怎么做吗？
: It can be interpreted in 2 ways. Either given a number of points, such as K=
: 0.9*N, find the smallest circle, or give a radius R, find the largest
: possible points.
| A**u
发帖数: 2458 | 3 most points 啥意思
所有点吗
K=
【在 c**********e 的大作中提到】
: N points (x_i, y_i) in a plane(3D space). find circle(sphere) containing
: most points. complexity?
: 这是daj大牛的一道题目。有人知道怎么做吗？
: It can be interpreted in 2 ways. Either given a number of points, such as K=
: 0.9*N, find the smallest circle, or give a radius R, find the largest
: possible points.
| L**********u
发帖数: 194 | |
|
