We prove that every set of n points in the plane has at most $(16+5/6)^n$ rectangulations. This improves upon a long-standing bound of Ackerman. Our proof is based on the cross-graph charging-scheme technique.

翻译：我们证明飞机上每组n点最多有(16+5/6)美元对流层。这在阿克曼的长期约束下有所改进。 我们的证据是基于交叉式指控方法。