摘要
设L为Euclidean平面上一连续曲线,在L的一侧有一个含n个固定点的集合N,且点集N的凸包CH(N)与曲线L不相交.问题是在L上找一点p,使点集N∪{p}的互联网络最短.本文在L是圆及点集N含有3个点的条件下给出了问题解.
Let L be a continuous curve on Euclidean plane, N be a set of n fixed points on
one side of L, and the convex hull of N, CH( N ), not touch the curve L. The problem is to
find a point p on L such that the network interconnecting the set N∪{p} is the shortest.In
this paper,the problem's answer is given under the condition that the N contains three points
and the curve L is a circle.
出处
《高校应用数学学报(A辑)》
CSCD
北大核心
1999年第2期185-188,共4页
Applied Mathematics A Journal of Chinese Universities(Ser.A)