Improved bounds for rectangular and guillotine partitions
From MaRDI portal
Publication:1123613
DOI10.1016/S0747-7171(89)80042-2zbMath0677.68041MaRDI QIDQ1123613
Si-Qing Zheng, Teofilo F. Gonzalez
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
computational geometryapproximation algorithmspolynomial time complexityguillotine partitionpartition of rectilinear polygons
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)
Related Items
On optimal guillotine partitions approximating optimal \(d\)-box partitions ⋮ The number of guillotine partitions in \(d\) dimensions ⋮ An approximation algorithm for dissecting a rectangle into rectangles with specified areas ⋮ Cut equivalence of \(d\)-dimensional guillotine partitions ⋮ Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations ⋮ On the number of rectangulations of a planar point set ⋮ EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
Cites Work