Topology optimization of arbitrary-size blocks using a bivariate formulation (Q1201028)

The authors use Blanks' objective function [cf. \textit{J. P. Blanks}, Near- optimal placement using a quadratic objective function, Proc. 22nd Design Automation Conf. 1985, 609-615] for the most compact placement of blocks by moving each block in turn in the direction of steepest descent for the objective function. The main point obviously is the determination of feasible segments in each such direction; these are given by sign conditions on the partial derivatives of the object function. Efficient implementation obviously is important here and one might hope that the authors would publish their code.