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

DOI10.1142/S0218195993000269zbMath0803.68136MaRDI QIDQ4289635

Mohammadreza Razzazi, Teofilo F. Gonzalez, Si-Qing 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)

Related Items (1)

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