An upper bound for the number of rectangulations of a planar point set

DOI10.37236/11398arXiv1911.09740WikidataQ129308594 ScholiaQ129308594MaRDI QIDQ6117435

Hannah Ashbach, Kiki Pichini

Publication date: 19 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Cites Work

• Unnamed Item
• Counting triangulations of planar point sets
• The Hopf algebra of diagonal rectangulations.
• Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
• On the number of plane geometric graphs
• Bijections for Baxter families and related objects
• On the number of rectangulations of a planar point set
• Counting Plane Graphs: Flippability and Its Applications
• Exploiting Air-Pressure to Map Floorplans on Point Sets
• Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• On the Number of Cycles in Planar Graphs
• Crossing-Free Subgraphs
• A simple aggregative algorithm for counting triangulations of planar point sets and related problems
• Counting Plane Graphs: Cross-Graph Charging Schemes
• Fast enumeration algorithms for non-crossing geometric graphs

This page was built for publication: An upper bound for the number of rectangulations of a planar point set