The number of guillotine partitions in \(d\) dimensions

DOI10.1016/j.ipl.2006.01.011zbMath1187.68334OpenAlexW2043560714MaRDI QIDQ844186

Dan Romik, Gill Barequet, Eyal Ackerman, Ron Yair Pinter

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.011

zbMATH Keywords

combinatorial problemsguillotine partitionsbinary space partitions

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (6)

Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube ⋮ Permutation of elements in double semigroups ⋮ Cut equivalence of \(d\)-dimensional guillotine partitions ⋮ Keep your distance: land division with separation ⋮ Separable \(d\)-permutations and guillotine partitions ⋮ Optimizing squares covering a set of points

Uses Software

• Maple
• Algolib

Cites Work

• Improved bounds for rectangular and guillotine partitions
• On optimal guillotine partitions approximating optimal \(d\)-box partitions
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• GFUN
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of guillotine partitions in \(d\) dimensions