Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

JCT
2006

favoriteEmaildiscussreport

60views more JCT 2006»

On the number of rectangulations of a planar point set

13 years 4 months ago

On the number of rectangulations of a planar point set

Download sci.haifa.ac.il

We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) segments, such that every point lies on a segment. We show that when the relative order of the points forms a separable permutation, the number of rectangulations is exactly the (n + 1)st Baxter number. We also show that no matter what the order of the points is, the number of guillotine rectangulations is always the nth Schr

Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Real-time Traffic

JCT 2006 | Noncorectilinear Points | Rectangles | Smaller Rectangles |

claim paper

Related Content

» An Upper Bound on the Number of Rectangulations of a Point Set

» On the Reflexivity of Point Sets

» On the Number of PseudoTriangulations of Certain Point Sets

» On the Number of Empty PseudoTriangles in Point Sets

» The Number of Triangulations on Planar Point Sets

» A lower bound on the number of triangulations of planar point sets

» Universal Sets of n Points for 1Bend Drawings of Planar Graphs with n Vertices

» Universal Sets of n Points for Onebend Drawings of Planar Graphs with n Vertices

» Coloring copoints of a planar point set

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Comments (0)