An Upper Bound for the Number of Rectangulations of a Planar Point Set
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2019
- DOI:
- 10.48550/arXiv.1911.09740
- arXiv:
- arXiv:1911.09740
- Bibcode:
- 2019arXiv191109740A
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Computational Geometry
- E-Print:
- 12 pages, 12 figures