论文信息 - A Simple Algorithm for Computing the Smallest Enclosing Circle

A Simple Algorithm for Computing the Smallest Enclosing Circle

Presented is a simple O(n log n) algorithm for computing the smallest enclosing circle of a convex polygon. It can be easily extended to algorithms that compute the farthest-and the closest-point Voronoi diagram of a convex polygon within the same time bound.

Sven Skyum | Sven Skyum

[1] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[2] Leonidas J. Guibas,et al. A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[3] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[4] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[5] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).