On the number of anchored rectangle packings for a planar point set

DOI10.1016/j.tcs.2016.03.007zbMath1353.05011OpenAlexW2299740086MaRDI QIDQ344784

Csaba D. Tóth, Kevin Balas

Publication date: 24 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.007

zbMATH Keywords

contact graphrectangle packingenumerative combinatorics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

Maximum Area Axis-Aligned Square Packings. ⋮ Anchored rectangle and square packings ⋮ Conflict-free coloring of string graphs ⋮ Packing boundary-anchored rectangles and squares

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing anchored rectangles
• A \((5/3+\varepsilon)\)-approximation for strip packing
• Labeling points with given rectangles
• Point labeling with sliding labels
• New combinatorial descriptions of the triangulations of cyclic polytopes and the second higher Stasheff--Tamari posets
• Reverse search for enumeration
• On the number of rectangulations of a planar point set
• Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
• Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
• Asymptotic enumeration and limit laws of planar graphs
• Crossing-Free Subgraphs
• A Census of Plane Graphs with Polyline Edges
• A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
• Improved Approximation Algorithm for Two-Dimensional Bin Packing
• Counting Plane Graphs: Cross-Graph Charging Schemes

This page was built for publication: On the number of anchored rectangle packings for a planar point set