the area of the Malfatti circles (left) is approximately 1% smaller than the three area-maximizing circles (right). posed the problem of cutting three cylindrical
columns out of a triangular prism of marble, maximizing the total volume of the columns. He assumed that the solution to this problem was given by three tangent circles within the triangular cross-section of the wedge. That is, more abstractly, he
conjectured that the three Malfatti circles have the maximum total area of any three disjoint circles within a given triangle. Malfatti's work was popularized for a wider readership in French by
Joseph Diaz Gergonne in the first volume of his
Annales (
1811), with further discussion in the second and tenth. However, Gergonne only stated the circle-tangency problem, not the area-maximizing one. Malfatti's assumption that the two problems are equivalent is incorrect. , who went back to the original Italian text, observed that for some triangles a larger area can be achieved by a
greedy algorithm that inscribes a single circle of maximal radius within the triangle, inscribes a second circle within one of the three remaining corners of the triangle, the one with the smallest angle, and inscribes a third circle within the largest of the five remaining pieces. The difference in area for an equilateral triangle is small, just over 1%, but as pointed out, for an
isosceles triangle with a very sharp apex, the optimal circles (stacked one atop each other above the base of the triangle) have nearly twice the area of the Malfatti circles. In fact, the Malfatti circles are never optimal. It was discovered through numerical computations in the 1960s, and later proven rigorously, that the Lob–Richmond procedure always produces the three circles with largest area, and that these are always larger than the Malfatti circles. conjectured more generally that, for any integer , the greedy algorithm finds the area-maximizing set of circles within a given triangle; the conjecture is known to be true for . ==History==