First learn computer science and all the theory. Next develop a programming style. Then forget all that and just hack. George Carrette
Smallest Enclosing Disk
Algorithm Problem Description
Minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane.
Write a program to implement smallest enclosing circle.
Output
X co-ordinate equal
Y co-ordinate equal
Radius equal
X co-ordinate equal
Radius equal
X co-ordinate equal
Radius equal
Comments
Please login to add comments.