Minimum Weight Disk Triangulations And Fillings

We study the minimum total weight of a disk triangulation using vertices out of {1, ..., n}, where the boundary is the triangle (123) and the ((n)(3)) triangles have independent weights, e.g. Exp(1) or U(0, 1). We show that for explicit constants c(1), c(2) > 0, this minimum is c(1) log n/root n + c2 log log n/root n + Yn/root n, where the random variableY n is tight, and it is attained by a triangulation that consists of 1/4 log n+Op(root log n) vertices. Moreover, for disk triangulations that are canonical, in that no inner triangle contains all but 0(1) of the vertices, the minimum weight has the above form with the law of Y-n converging weakly to a shifted Gumbel. In addition, we prove that, with high probability, the minimum weights of a homological filling and a homotopical filling of the cycle (123) are both attained by the minimum weight disk triangulation.