AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES

DOI10.1142/S0218195993000269MaRDI QIDQ4289635zbMATH OpenFDO

Authors Mohammadreza Razzazi, Teofilo F. Gonzalez, S. Q. Zheng

Publication date 26 May 1994

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

approximation algorithms\(d\)-box partitionsminimize \((d-1)\)-volumemultidimensional computational geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On optimal guillotine partitions approximating optimal \(d\)-box partitions
• Improved bounds for rectangular and guillotine partitions
• On rectilinear partitions with minimum stabbing number
• Approximation algorithms for partitioning a rectangle with interior points

Cited in

(2)

• On optimal guillotine partitions approximating optimal \(d\)-box partitions
• EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING

This page was built for publication: AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES

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