On the Number of Anchored Rectangle Packings for a Planar Point Set

DOI10.1007/978-3-319-21398-9_30zbMath1432.05007OpenAlexW2280889568MaRDI QIDQ3196400

Kevin Balas, Csaba D. Tóth

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_30

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

• Unnamed Item
• Unnamed Item
• Packing anchored rectangles
• A \((5/3+\varepsilon)\)-approximation for strip packing
• Point labeling with sliding labels
• The one-round Voronoi game
• New combinatorial descriptions of the triangulations of cyclic polytopes and the second higher Stasheff--Tamari posets
• A better upper bound on the number of triangulations of a planar point set
• Competitive facility location: the Voronoi game
• Reverse search for enumeration
• On the number of rectangulations of a planar point set
• Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
• 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