Combinatorial generation via permutation languages. III: Rectangulations

DOI10.1007/s00454-022-00393-warXiv2103.09333OpenAlexW3138159625MaRDI QIDQ6156087

Torsten Mütze, Arturo I. Merino

Publication date: 12 June 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

cartogrampolytopeGray codepermutation patternexhaustive generationflip graphgeneric rectangulationfloorplandiagonal rectangulation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Discrete geometry (52C99)

Related Items (2)

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of tilings of a square by rectangles
• Generic rectangulations
• Separable \(d\)-permutations and guillotine partitions
• The Hopf algebra of diagonal rectangulations.
• On rectangular cartograms
• Transversal structures on triangulations: A combinatorial study and straight-line drawings
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Reverse search for enumeration
• Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
• Combinatorial generation via permutation languages. II. Lattice congruences
• Aspect ratio universal rectangular layouts
• Bijections for Baxter families and related objects
• A simple optimal binary representation of mosaic floorplans and Baxter permutations
• A bijection between permutations and floorplans, and its applications
• On the number of rectangulations of a planar point set
• Shard polytopes
• The Greedy Gray Code Algorithm
• Rectangle and Square Representations of Planar Graphs
• Area-Universal and Constrained Rectangular Layouts
• Efficient generation of the binary reflected gray code and its applications
• A Survey of Combinatorial Gray Codes
• A Note on Flips in Diagonal Rectangulations
• Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence
• Quotientopes
• Combinatorial generation via permutation languages
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Combinatorial generation via permutation languages. I. Fundamentals

This page was built for publication: Combinatorial generation via permutation languages. III: Rectangulations