/// <summary>
/// linear-time computation using the move-to-front heuristic by Welzl
/// </summary>
/// <param name="points">points that must be enclosed</param>
/// <returns>Smallest disc that encloses all the points</returns>
public static Disc LinearComputation(Point[] points)
{
MoveToFront m = new MoveToFront(points);
return(m.disc);
}
/// <summary>
/// linear-time computation using the move-to-front heuristic by Welzl
/// </summary>
/// <param name="points">points that must be enclosed</param>
/// <returns>Smallest disc that encloses all the points</returns>
public static Disc LinearComputation(Point[] points)
{
MoveToFront m = new MoveToFront(points);
return m.disc;
}