In this paper we consider the one-dimensional compaction prob· lem when the layout area contains forbidden regions and the layout components are allowed to move across these regions. Given n layout components and k forbidden regions, each of rectangular shape, we show how to solve this compaction problem in O(A) time with O(Cn + k) log k + 0 logo) preprocessing, where 6. and 6 are measures for ...