A simple optimal binary representation of mosaic floorplans and Baxter permutations

DOI10.1016/j.tcs.2013.05.007zbMath1418.05007arXiv1111.4937MaRDI QIDQ2445870

Bryan Dawei He

Publication date: 15 April 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.4937

zbMATH Keywords

Baxter permutation; floorplan; binary representation; mosaic floorplan

Mathematics Subject Classification ID

68R05: Combinatorics in computer science

05A05: Permutations, words, matrices

05B45: Combinatorial aspects of tessellation and tiling problems

Related Items

Transformations among rectangular partitions, Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube, Unnamed Item, Combinatorial generation via permutation languages. III: Rectangulations, Constrained floorplans in 2D and 3D, A transformation algorithm to construct a rectangular floorplan, Rectilinear Duals Using Monotone Staircase Polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Aztec diamonds and Baxter permutations
• A bijection between permutations and floorplans, and its applications
• Algebraic and combinatorial structures on Baxter permutations
• Baxter permutations and plane bipolar orientations
• A (4n − 4)-Bit Representation of a Rectangular Drawing or Floorplan
• On Fixed Points of the Composite of Commuting Functions
• The quarter-state-sequence floorplan representation
• A Compact Encoding of Rectangular Drawings with Efficient Query Supports
• Baxter permutations