  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.
