Efficient generation of rectangulations via permutation languages

DOI10.4230/LIPICS.SOCG.2021.54MaRDI QIDQ7234112zbMATH OpenFDO

Authors Arturo I. Merino, Torsten Mütze

Publication date 27 April 2026

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

cartogrampolytopeexhaustive generationgray codepermutation patternflip graphgeneric rectangulationfloorplandiagonal rectangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 2080983 (Why is no real title available?)
• A Survey of Combinatorial Gray Codes
• A bijection between permutations and floorplans, and its applications
• A note on flips in diagonal rectangulations
• A simple optimal binary representation of mosaic floorplans and Baxter permutations
• Area-universal and constrained rectangular layouts
• Combinatorial generation via permutation languages
• Efficient generation of the binary reflected gray code and its applications
• Generic rectangulations
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• On rectangular cartograms
• On the number of rectangulations of a planar point set
• On the number of tilings of a square by rectangles
• Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
• Quotientopes
• Reverse search for enumeration
• Separable \(d\)-permutations and guillotine partitions
• The Hopf algebra of diagonal rectangulations.
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The greedy Gray code algorithm

This page was built for publication: Efficient generation of rectangulations via permutation languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234112)