An Upper Bound for the Number of Rectangulations of a Planar Point Set

11/21/2019

∙

by   Kiki Pichini, et al.

∙

0

∙

share

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