On the number of rectangulations of a planar point set

Authors:
Eyal Ackerman;Gill Barequet;Ron Y. Pinter
Affiliations:
Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel;Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel;Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel
Venue:
Journal of Combinatorial Theory Series A
Year:
2006

Citing 14
Cited 3

Fast heuristics for minimum length rectangular partitions of polygons

SCG '86 Proceedings of the second annual symposium on Computational geometry
Improved bounds for rectangular and guillotine partitions

Journal of Symbolic Computation
Bootstrap percolation, the Schro¨der numbers, and the N-kings problem

SIAM Journal on Discrete Mathematics
Deterministic skip lists

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Generating trees and the Catalan and Schro¨der numbers

Discrete Mathematics
Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Baxter permutations

Proceedings of the 7th conference on Formal power series and algebraic combinatorics
Pattern matching for permutations

Information Processing Letters
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
Bounds for partitioning rectilinear polygons

SCG '85 Proceedings of the first annual symposium on Computational geometry
Corner block list: an effective and efficient topological representation of non-slicing floorplan

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Floorplan representations: Complexity and connections

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A better upper bound on the number of triangulations of a planar point set

Journal of Combinatorial Theory Series A
Bounds on the number of slicing, mosaic, and general floorplans

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Bijections for Baxter families and related objects

Journal of Combinatorial Theory Series A
The Hopf algebra of diagonal rectangulations

Journal of Combinatorial Theory Series A
Generic rectangulations

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 (nonintersecting) 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öder number, and the total number of rectangulations is O(20n/n4).