Sciweavers

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

9

COCOON
2005
Springer

favoriteEmaildiscussreport

67views Combinatorics» more COCOON 2005»

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

13 years 10 months ago

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

Download page.mi.fu-berlin.de

Abstract. We consider the number of diﬀerent ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments, such that every point is on a segment. Using a novel counting technique of Santos and Seidel [12], we show an upper bound of O(20n /n4 ) on this number.

Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Real-time Traffic

COCOON 2005 | Non-intersecting Axis-parallel Segments | Rectangles | Smaller Rectangles |

claim paper

Related Content

» On the number of rectangulations of a planar point set

» The number of extreme points of tropical polyhedra

» Coloring copoints of a planar point set

» Small Strictly Convex Quadrilateral Meshes of Point Sets

» Average equidistribution and statistical independence properties of digital inversive pseu...

» Obtainable sizes of topologies on finite sets

» Number of CrossingFree Geometric Graphs vs Triangulations

» Star forests dominating sets and Ramseytype problems

» Counting Plane Graphs Flippability and its Applications

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	COCOON
Authors	Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Comments (0)