On optimal guillotine partitions approximating optimal \(d\)-box partitions

DOI10.1016/0925-7721(94)90013-2zbMath0807.68099OpenAlexW2007813600MaRDI QIDQ1327171

Si-Qing Zheng, Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing

Publication date: 15 June 1994

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(94)90013-2

zbMATH Keywords

approximation algorithmoptimal guillotine partition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (4)

The number of guillotine partitions in \(d\) dimensions ⋮ An approximation algorithm for dissecting a rectangle into rectangles with specified areas ⋮ Keep your distance: land division with separation ⋮ EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING

Cites Work

• Unnamed Item
• Improved bounds for rectangular and guillotine partitions
• Approximation algorithms for partitioning a rectangle with interior points

This page was built for publication: On optimal guillotine partitions approximating optimal \(d\)-box partitions