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

DOI10.1016/J.TCS.2016.03.007zbMATH Open1353.05011OpenAlexW2299740086MaRDI QIDQ344784FDOQ344784

Authors: Kevin Balas, Csaba D. Tóth 

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

Recommendations

• On the number of anchored rectangle packings for a planar point set
• Anchored rectangle and square packings
• Anchored rectangle and square packings
• Packing anchored rectangles
• Packing boundary-anchored rectangles and squares

zbMATH Keywords

rectangle packingenumerative combinatoricscontact graph

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)

Cites Work

• Asymptotic enumeration and limit laws of planar graphs
• Improved approximation algorithm for two-dimensional bin packing
• Packing anchored rectangles
• A \((5/3+\varepsilon)\)-approximation for strip packing
• Mathematical mind-benders
• Reverse search for enumeration
• Bounds on the maximum multiplicity of some common geometric graphs
• Crossing-Free Subgraphs
• Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
• Title not available (Why is that?)
• Point labeling with sliding labels
• Labeling points with given rectangles
• New combinatorial descriptions of the triangulations of cyclic polytopes and the second higher Stasheff--Tamari posets
• On the number of rectangulations of a planar point set
• Title not available (Why is that?)
• A census of plane graphs with polyline edges
• A quasi-PTAS for the two-dimensional geometric knapsack problem
• Counting plane graphs: cross-graph charging schemes

Cited In (6)

• Packing boundary-anchored rectangles and squares
• On the number of anchored rectangle packings for a planar point set
• Combinatorial properties of triangle-free rectangle arrangements and the squarability problem
• Conflict-free coloring of string graphs
• Anchored rectangle and square packings
• Maximum area axis-aligned square packings

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

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