Repeated placement treated in this paper is the problem to place multiple copies of a set of rectangles so that copies of every rectangle appears repeatedly with a common interval L. To identify the solution space of this repeated placement problem, and to construct efficient algorithms for treating those placements, a coding system for those repeated placements of rectangles is proposed in this paper. It is inspired from the sequence pair proposed for one-time placement, and uses three permutations of rectangles (i.e., sequence triple). In compensation for one additional permutation to a sequence pair, not only intra-cycle spatial relation between rectangles but also inter-cycle spatial relation between rectangles can be represented and specifed.
展开▼
