Measuring programming progress by lines of code is like measuring aircraft building progress by weight. Bill Gates

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.