The method to find the best rectangle in Chapter 3 (Matlab codes)

<div>In Chapter 3, we use the numerical method to find the best rectangle which gives the area of convex hull of a circle, an equilateral triangle and this rectangle is as large as possible. There are three files:</div><div><br></div>McodeNNNper2 is a code to find maxmin of the best rectangle.<div><br></div><div>NNper3 is a function to find minimum of convex hull area of the best rectangle, a circle, and an equilateral triangle.</div><div><br></div><div>cvhNN4 is a function to find convex hull area of the best rectangle, a circle, and an equilateral triangle.</div>