Find the smallest circle that encloses all of the points Note that this is a non-optimal algorithm, but the number of points is guaranteed to be small Ref: http://csharphelper.com/blog/2014/08/find-a-minimal-bounding-circle-of-a-set-of-points-in-c/

'Declaration
 
Public Shared Function FindMinimalBoundingCircle( _
   ByVal points As PointCollection _
) As ValueTuple(Of Double,Point)

'Usage
 
Dim points As PointCollection
Dim value As ValueTuple(Of Double,Point)
 
value = ConduitLayoutGeometry.FindMinimalBoundingCircle(points)

public static ValueTuple<double,Point> FindMinimalBoundingCircle( 
   PointCollection points
)