New Algorithms for the Planar Two-center Problem
碩士 === 國立中正大學 === 資訊工程研究所 === 80 === Let S be a set of n points on the plane. The two-center problem is to partition S into two subsets such that the larger radius of the smallest enclosing circles of these two subsets is minimized. In this thesis, we present a new algorithm to solve the two-cent...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1992
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/27125924419439055847 |
| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 80 ===
Let S be a set of n points on the plane. The two-center problem is to partition S into two subsets such that the larger radius of the smallest enclosing circles of these two subsets is minimized. In this thesis, we present a new algorithm to solve the two-center problem when the well_cut condition is satisfied. The time complexity of our algorithm is O(n2). However, when the well_cut condition is not satisfied, our algorthm will not generate an optimal solution. Two heuristic algorithms will be proposed to handle this case.
|
|---|