【摘要】 就d>2R的情形解决如下组合几何极值问题:某平原地区有一个很大的湖泊.湖泊周围有两个村庄A,B.村庄A到村庄B的直线距离为已知.一辆汽车从A村庄出发以已知匀速速度驶向村B庄.问:若这辆汽车以最短路径行驶到达B村庄至多需要多少时间?更多还原

【Abstract】 For the case d>2R,the aim of this paper is to solve the following extreme Value problem of combinatorial geometry: There exists a large lake in some plain,and there are two villages named A and B on the lakeside.Assume the line distance between A and B is given.A car wishes to travel from A to B at the given uniform velocity.We ask: If this car can reach B along the shortest route,how much long this car at most needs the time?更多还原