For a long time it puzzled me how something so expensive, so leading edge, could be so useless. And then it occurred to me that a computer is a stupid machine with the ability to do incredibly smart things, while computer programmers are smart people with the ability to do incredibly stupid things. They are, in short, a perfect match. Bill Bryson

Smallest Enclosing Disk

Language Java | Level Intermediate | Category Algorithms | August 5, 2015 9:10 am


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.