Navigation Image

References

 

For a nice Applet demonstrating the MEC of a set of points see http://www.cs.brown.edu/people/tor/java/mec/.

Chrystal, "On the problem to contruct the minimum circle enclosing n given points in a plane". Proceedings of the Edinburgh Mathematical Society, Third Meeting, Jan 9 1885, pp30.

Dyer, M. and N. Megiddo, "Linear programming in low dimensions", Chapter 38 in The Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, Eds.). Boca Raton: CRC Press LLC, July 1997, pp. 699 - 710.

Goodman & O'Rourke, Handbook of Discrete and Computational Geometry. Boca Raton: CRC Press, 1997.

Megiddo, N., "Linear-time algorithms for linear programming in R3 and related problems". SIAM Journal on Computing, vol 12 number 4, Nov 1983.

Preparata & Shamos, Computational Geometry: An Introduction. New York: Springer-Verlag, 1985.

Rademacher, H. & O. Töplitz, The Enjoyment of Mathematics. Princeton: Princeton University Press, 1957.

Skyum, "A simple algorithm for computing the smallest enclosing circle". Information Processing Letters 3(1991) 121-125.

Home



by Jacob Eliosoff & Richard Unger, October 1998