Method and electronic apparatus for optimal arrangement of shapes having at least two dimensions
First Claim
1. A method of optimal arrangement of multidimensional shapes within a predetermined space, comprising the following steps:
- (i) storing data, in vectorial form, of shapes already arranged;
(ii) providing data, in vectorial form, of shapes to be arranged;
(iii) generating one of a predetermined number of positions of one of said shapes to be arranged within said predetermined space with respect to said shapes already arranged;
(iv) repeating said step (iii) in accordance with a comparison of row-column resolutions of said shapes already arranged with said one of said shapes to be arranged, a scalar value being assigned to each outcome of said step (iii) in accordance with a predetermined algorithm;
(v) storing, in vectorial form, a position of said one of said shapes to be arranged, in accordance with scalar values generated in said steps (iii)-(iv), whereby said one of shapes to be arranged becomes one of said shapes already arranged; and
(vi) repeating said steps (i)-(v) until an insufficient amount of said space remains to arrange any more shapes.
0 Assignments
0 Petitions
Accused Products
Abstract
The present invention relates to a method and an electronic apparatus for optimal arrangement of shapes having at least two dimensions, whereby optimization can be performed quickly while satisfying several requirements at the same time.
According to the proposed method shapes to be arranged are stored in the form of vectors, the unfilled areas among the shapes already arranged are defined and the shapes to be arranged are tried to be inserted in these unfilled areas while examining the accidental coincidences in row-line-resolution.
The proposed apparatus includes a vector memory (1), a vector/raster converter (2), a window generator (3), a displacement generator (4), an occupation analyzer (5), a control unit (6), a display unit (7), an external source (8) and intervening organs (9), wherein the vector memory (1) is connected to the control unit (6), the displacement generator (4) and the vector/raster converter (2), the external source (8) is connected to the displacement generator (4) and the control unit (6), the control unit (6) is connected to the displacement generator (4), the window generator (3), the occupation analyzer (5) and the intervening organs (9), the occupation analyzer (5) is connected to the vector/raster converter (2), the vector/raster converter (2) is connected to the display unit (7), the window generator (3) is connected to the displacement generator (4) and the vector memory (1) or the vector/raster converter (2).
22 Citations
12 Claims
-
1. A method of optimal arrangement of multidimensional shapes within a predetermined space, comprising the following steps:
-
(i) storing data, in vectorial form, of shapes already arranged; (ii) providing data, in vectorial form, of shapes to be arranged; (iii) generating one of a predetermined number of positions of one of said shapes to be arranged within said predetermined space with respect to said shapes already arranged; (iv) repeating said step (iii) in accordance with a comparison of row-column resolutions of said shapes already arranged with said one of said shapes to be arranged, a scalar value being assigned to each outcome of said step (iii) in accordance with a predetermined algorithm; (v) storing, in vectorial form, a position of said one of said shapes to be arranged, in accordance with scalar values generated in said steps (iii)-(iv), whereby said one of shapes to be arranged becomes one of said shapes already arranged; and (vi) repeating said steps (i)-(v) until an insufficient amount of said space remains to arrange any more shapes. - View Dependent Claims (2, 3, 4)
-
-
5. An apparatus for optimal arrangement of multidimensional shapes within a predetermined space, said apparatus comprising:
-
vector memory means for storing, in vectorial form, data representing shapes already arranged within said predetermined space; window generator means for generating vectorial representations of boundaries between shapes already arranged and unfilled portions of said predetermined space; and displacement generator means for determining placement of shapes to be arranged in accordance with scalar values generated pursuant to comparisons of vectorial representations of said unfilled portions with vectorial representations of different orientations and positions of said shapes to be arranged, said displacement generator means performing said comparisons and selecting an appropriate one of said positions and orientations, whereby said optimal arrangement is achieved. - View Dependent Claims (6, 7, 8, 9, 10, 11, 12)
-
Specification