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

11/21/2019
by   Kiki Pichini, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2023

On RAC Drawings of Graphs with Two Bends per Edge

It is shown that every n-vertex graph that admits a 2-bend RAC drawing i...
research
10/02/2022

No Selection Lemma for Empty Triangles

Let S be a set of n points in general position in the plane. The Second ...
research
10/07/2017

A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations

Given a triangulation of a point set in the plane, a flip deletes an edg...
research
03/15/2022

Chains, Koch Chains, and Point Sets with many Triangulations

We introduce the abstract notion of a chain, which is a sequence of n po...
research
03/07/2019

A face cover perspective to ℓ_1 embeddings of planar graphs

It was conjectured by Gupta et. al. [Combinatorica04] that every planar ...
research
07/04/2019

Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs

We prove that in sparse Erdős-Rényi graphs of average degree d, the vect...
research
07/28/2018

An upper bound for min-max angle of polygons

Let S be a set of points in the plane, CH be the convex hull of S, (S) b...

Please sign up or login with your details

Forgot password? Click here to reset