本程序主要用于求解小圆覆盖大圆问题，本问题中小圆之间不可能无缝拼接，必须相互重叠拼接形成网格，不同的重叠方式覆盖面积的效率差异很大，朱里奇在其著作《基站与无线技术》中已经证明蜂窝状正六边形网格覆盖效率最大。因而本文求解过程中优先选择正六边形网格法求解。若正六边形网格不能恰好完整覆盖目标，此时，需要先采用圆周覆盖法将大圆圆周完整覆盖，再对大圆中心区域填补的方法，填补时优先采用正六边形网格。本求解方法适合于R/r>2情况下，对于R/r<2情况下早有学者证明并给出了最佳方案，本程序中直接引用。-This procedure is mainly used to solve the small round cover large circle problem, the problem can not be seamlessly stitched between small rounds, must be overlapped with each other to form a grid, different overlapping mode of coverage area of the efficiency difference is very large, Julie in his book　 Base station and wireless technology　has proved that the honeycomb-shaped hexagonal grid coverage is the most efficient. Therefore, in this paper, we choose the hexagonal grid method to solve the problem. If the hexagonal grid can not be completely covered by the target, this time, you need to use the circular cover method to cover the large circle full coverage, and then fill the center of the large circle of the method to fill the priority when using hexagonal grid. This solution is suitable for R/r> 2 cases, for R/r <2 cases have long been proved and given the best program, the direct reference in this procedure.