POJ 1981 Circle and Points rings: there are N points in the plane, with the unit circle to cover, up to a few sets? 3.6 Calculation of dealing with the limit plane and spatial geometry is the limiting case of a so-called two points on the unit circle, will move it slightly loss of a point, to cover up to the point of this circle is the circle constant (of course, when N = 1 when It is an exception). The idea is simple to fix two points, and then enumerate the other point is within two circles two points decision, plain and simple dregs I do not write. Faster algorithm is fixed only to a point i, j the unit circle of the point of intersection with the other point of the unit circle, an arc is formed on the circle i, j is the arc of a circle covered. If the final round in the arc, the coating must be able to ...
Continue reading : yard farm >> POJ 1981 Points Circle and problem solution "Challenge Programming Contest"
Original link : http://www.hankcs.com/program/algorithm/poj-1981-circle-and-points.html
Reproduced in: https: //my.oschina.net/hankcs/blog/376555