We show that the number of partial triangulations of a set of nn points on the plane is at least the (n−2)(n−2)-nd Catalan number. This is tight for convex nn-gons. We also describe all the equality cases.
生成讲解博客的中文版本
生成AI智能校验的中文版本