摘要或動機

本研究從理想城鎮(Ideal City)街道開始，討論平面上相異n 點到某一點的最短距離和。經研究後發現：當n 為偶數時，則到相異n 點的最短距離和所形成的區域可能是一個點、一個線段或是一個矩形；當n 為奇數時，則相異n 點的最短距離和所形成的區域將會退化成一個點。此外，本研究將理想城鎮的街道換成正三角形的街道幾何平面，同樣是討論平面上相異n 點到某一點的最短距離和。經研究後發現：當n 為偶數時，則相異n 點的最短距離和所形成的區域可能為一個點、一個線段、一個四邊形、一個五邊形及一個六邊形；當n 為奇數時，相異n 點的最短距離和所形成的區域則可能為點、三角形的情況。假使考量各點重要性的比重，分別加權後再求最小點。研究發現無論在理想城鎮或正三角形幾何平面上，皆可將各點視為多個權數相同之點重疊於此點上，便可利用先前的方式求得最小點區域。透過這次的研究，可以利用n 個相異點到某一點的最短距離和實際應用在貨物運送的問題或是消防設施配置等問題。The present study was intended to start with the Ideal City and proceed to discuss the sum of the shortest distance between a point and n different points on a plane. After the discussion, it was found that if n is even, the formed region could be a point, a line segment, or a rectangle. If n is odd, then the formed region must be a mere point. Further, the current study transformed the Ideal City into the geometric plane of an equilateral triangle. Similar to the previous discussion, if n is even, the formed region could be a point, a line segment, a quadrangle, a pentagon, or a hexagon. On the other hand, if n is odd, then the formed region could be a point, or a triangle. The result of this study, which investigated the sum of the shortest distance of a certain point to n different points can be applied to the real life situation, such as transporting goods or distributing fire control facilities.