探讨了如何找到一个二维网格上N个人的最佳会合点，使得每个人到该点的距离之和最小化。考虑从费马点的角度出发进行求解。
On a 2-D grid, the positions (x,y) of 3 persons are given. Find the meeting point such that sum of distances of each person from meeting
point is minimized.
Now generalize this to N persons and solve.
--------------------------------------------------------
may be it is fermat point of a traingle...
扫一扫
645
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
