arXiv Analytics

Sign in

arXiv:1911.09740 [math.CO]AbstractReferencesReviewsResources

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

Kiki Pichini

Published 2019-11-21Version 1

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.

Comments: 8 pages, 5 figures
Categories: math.CO, cs.CG
Related articles: Most relevant | Search more
arXiv:1011.1866 [math.CO] (Published 2010-11-08, updated 2013-07-03)
On Pseudo-Convex Partitions of a Planar Point Set
arXiv:0906.0195 [math.CO] (Published 2009-06-01, updated 2010-04-28)
New upper bound for the cardinalities of $s$-distance sets on the unit sphere
arXiv:math/0302126 [math.CO] (Published 2003-02-11, updated 2003-05-30)
The polytope of non-crossing graphs on a planar point set

Links

Toolbox