METHOD OF SEAMING AND EXPANDING AMORPHOUS PATTERNS

Abstract: The present invention provides a method for creating amorphous patterns based on a constrained Voronoi tesselation of 2-space that can be tiled. There are three basic steps required to generate a constrained Voronoi tesselation of 2-space: 1) nucleation point placement; 2) Delauney triangulation of the nucleation points; and 3) polygon extraction from the Delauney triangulated space. The tiling feature is accomplished by modifying only the nucleation point poriton of the algorithm. The method of the present invention, for creating an amorphous two-dimensional pattern of interlocking two-dimensional geometrical shapes having at least two opposing edges which can be tiled together, comprises the steps of: (a) specifying the width xmax of the pattern measured in direction x between the opposing edges; (b) adding a computational border region of width B to the pattern along one of the edges located at the x distance xmax; (c) computationally generating (x, y) coordinates of a nucleation point having x coordinates between 0 and xmax; (d) selecting nucleation points having x coordinates between 0 and B and copying them into the computational border region by adding xmax to their x coordinate value; (e) comparing both the computationally generated nucleation point and the corresponding copied nucleation point in the computational border against all previously generated nucleation points; and (f) repeating steps (c) through (e) until the desired number of nucleation points has been generated. To complete the pattern formation process, the additional steps of: (g) performing a Delaunay triangulation on the nucleation points; and (h) performing a Voronoi tessellation on the nucleation points to form two-dimensional geometrical shapes are included. Patterns having two pairs of opposing edges which may be tiled together may be generated by providing computional borders in two mutually orthogonal coordinate directions.

Description: METHOD OF SEAMING AND EXPANDING AMORPHOUS PATTERNS FIELD OF THE INVENTION The present invention relates to amorphous patterns useful m manufacturing three- dimensional sheet mateπals that resist nesting of supeπmposed layers into one another The present invention further relates to a method of creating such patterns which permits the patterns to be seamed edge-to-edge with themselves or other identical patterns without interruptions in the form of visible seams in the pattern. BACKGROUND OF THE INVENTION The use of amorphous patterns for the prevention of nesting m wound rolls of three dimensional sheet products has been disclosed in commonly-assigned, co-pending (allowed) U.S. Patent Application Serial No. 08/745,339, filed November 8, 1996 m the names of McGuire, Tweddell, and Hamilton, entitled "Three-Dimensional, Nesting-Resistant Sheet Mateπals and Method and Apparatus for Making Same", the disclosure of which is hereby incorporated herein by reference. In this application, a method of generating amorphous patterns with remarkably uniform properties based on a constrained Voronoi tesselation of 2-space was outlined. Using this method, amorphous patterns consisting of an interlocking networks of irregular polygons are created using a computer. The patterns created using the method descπbed in the above mentioned application work quite well for flat, small mateπals. However, when one tπes to use these patterns in the creation of production tooling (such as embossing rolls), there is an obvious seam where the pattern "meets" as it is wrapped around the roll due to the diverse edges of the pattern. Further, for very large rolls, the computing time required to generate the pattern to cover these rolls becomes overwhelming. What is needed then, is a method of creating these amorphous patterns that allows "tiling." As utilized herein, the terms "tile", "tiling", and "tiled" refer to a pattern or pattern element compπsmg a bounded region filled with a pattern design which can be joined edge-wise to other identical patterns or pattern elements having complementary but non-identical edge geometries to form a larger pattern having no visually-apparent seam. If such a "tiled" pattern were used in the creation of an embossing roll, there would be no appearance of a seam where flat the pattern "meets" as it is wrapped around the roll. Further, a very large pattern (such as the surface of a large embossing roll) could be made by "tiling" a small pattern, and there would be no appearance of a seam at the edges of the small pattern tiles. Accordingly, it would be desirable to provide a method of creating amorphous patterns based on a constrained Voronoi tesselation of 2-space that can be "tiled" with no appearance of a seam at the tile edges. SUMMARY OF THE INVENTION The present invention provides a method for creating amorphous patterns based on a constrained Voronoi tesselation of 2-space that can be tiled. There are three basic steps required to generate a constrained Voronoi tesselation of 2-space: 1) nucleation point placement; 2) Delauney tπangulation of the nucleation points; and 3) polygon extraction from the Delauney tπangulated space. The tiling feature is accomplished by modifying only the nucleation point portion of the algoπthm. The method of the present invention, for creating an amorphous two-dimensional pattern of interlocking two-dimensional geometπcal shapes having at least two opposing edges which can be tiled together, compπses the steps of: (a) specifying the width X max of the pattern measured in direction x between the opposing edges; (b) adding a computational border region of width B to the pattern along one of the edges located at the x distance x^; (c) computationally generating (x,y) coordinates of a nucleation point having x coordinates between 0 and x^; (d) selecting nucleation points having x coordinates between 0 and B and copying them into the computational border region by adding X π _ « to their x coordinate value; (e) compaπng both the computationally generated nucleation point and the corresponding copied nucleation point in the computational border against all previously generated nucleation points; and (f) repeating steps (c) through (e) until the desired number of nucleation points has been generated. To complete the pattern formation process, the additional steps of: (g) performing a Delaunay tπangulation on the nucleation points; and (h) performing a Voronoi tessellation on the nucleation points to form two-dimensional geometπcal shapes are included. Patterns having two pairs of opposing edges which may be tiled together may be generated by providing computational borders in two mutually orthogonal coordinate directions. BRIEF DESCRIPTION OF THE DRAWINGS While the specification concludes with claims which particularly point out and distinctly claim the present invention, it is believed that the present invention will be better understood from the following descπption of preferred embodiments, taken in conjunction with the accompanying drawings, in which like reference numerals identify identical elements and wherein: Figure 1 is a plan view of four identical "tiles" of a representative pπor art amorphous pattern; Figure 2 is a plan view of the four pnor art "tiles" of Figure 1 moved into closer proximity to illustrate the mismatch of the pattern edges; Figure 3 is a plan view similar to Figure 1 of four identical "tiles" of a representative embodiment of an amorphous pattern in accordance with the present invention; Figure 4 is a plan view similar to Figure 2 of the four "tiles" of Figure 3 moved into closer proximity to illustrate the matching of the pattern edges; Figure 5 is a schematic illustration of dimensions referenced m the pattern generation equations of the present invention; and Figure 6 is a schematic illustration of dimensions referenced in the pattern generation equations of the present invention. DETAILED DESCRIPTION OF THE INVENTION Figure 1 is an example of a pattern 10 created using the algoπthm descπbed in the previously referenced McGuire et al. application. Included in Figure 1 are four identical "tiles" of the pattern 10 which have identical dimensions and are oπented in an identical fashion. If an attempt is made to "tile" this pattern, as shown in Figure 2, by bπnging the "tiles" 10 into closer proximity to form a larger pattern, obvious seams appear at the border of adjacent tiles or pattern elements. Such seams are visually distracting from the amorphous nature of the pattern and, in the case of a three-dimensional matenal made from a forming structure using such a pattern, the seams create disturbances in the physical properties of the matenal at the seam locations. Since the tiles 10 are identical, the seams created by bnnging opposing edges of identical tiles together also illustrates the seams which would be formed if opposite edges of the same pattern element were brought together, such as by wrapping the pattern around a belt or roll. In contrast, Figures 3 and 4 show similar views of a pattern 20 created using the algoπthm of the present invention, as descπbed below. It is obvious from Figures 3 and 4 that there is no appearance of a seam at the borders of the tiles 20 when they are brought into close proximity. Likewise, if opposite edges of a single pattern or tile were brought together, such as by wrapping the pattern around a belt or roll, the seam would likewise not be readily visually discernible. As utilized herein, the term "amorphous" refers to a pattern which exhibits no readily perceptible organization, regulanty, or orientation of constituent elements. This definition of the term "amorphous" is generally in accordance with the ordinary meaning of the term as evidenced by the corresponding definition in Webster's Ninth New Collegiate Dictionary. In such a pattern, the orientation and arrangement of one element with regard to a neighboring element bear no predictable relationship to that of the next succeeding element(s) beyond. By way of contrast, the term "array" is utilized herein to refer to patterns of constituent elements which exhibit a regular, ordered grouping or arrangement. This definition of the term "array" is likewise generally m accordance with the ordinary meaning of the term as evidenced by the corresponding definition in Webster's Ninth New Collegiate Dictionary. In such an array pattern, the onentation and arrangement of one element with regard to a neighboπng element bear a predictable relationship to that of the next succeeding element(s) beyond. The degree to which order is present m an array pattern of three-dimensional protrusions bears a direct relationship to the degree of nestabihty exhibited by the web. For example, m a highly-ordered array pattern of uniformly-sized and shaped hollow protrusions in a close-packed hexagonal array, each protrusion is literally a repeat of any other protrusion. Nesting of regions of such a web, if not m fact the entire web, can be achieved with a web alignment shift between superimposed webs or web portions of no more than one protrusion-spacmg in any given direction. Lesser degrees of order may demonstrate less nesting tendency, although any degree of order is believed to provide some degree of nestabihty. Accordingly, an amorphous, non-ordered pattern of protrusions would therefore exhibit the greatest possible degree of nesting-resistance. Three-dimensional sheet mateπals having a two-dimensional pattern of three-dimensional protrusions which is substantially amorphous m nature are also believed to exhibit "isomorphism" . As utilized herein, the terms "isomorphism" and its root "isomorphic" are utilized to refer to substantial uniformity in geometπcal and structural properties for a given circumscribed area wherever such an area is delineated within the pattern. This definition of the term "isomorphic" is generally in accordance with the ordinary meaning of the term as evidenced by the corresponding definition m Webster's Ninth New Collegiate Dictionary. By way of example, a prescπbed area compnsmg a statistically-significant number of protrusions with regard to the entire amorphous pattern would yield statistically substantially equivalent values for such web properties as protrusion area, number density of protrusions, total protrusion wall length, etc. Such a correlation is believed desirable with respect to physical, structural web properties when uniformity is desired across the web surface, and particularly so with regard to web properties measured normal to the plane of the web such as crush-resistance of protrusions, etc. Utilization of an amorphous pattern of three-dimensional protrusions has other advantages as well. For example, it has been observed that three-dimensional sheet mateπals formed from a matenal which is initially isotropic within the plane of the matenal remain generally isotropic with respect to physical web properties in directions within the plane of the matenal. As utilized herein, the term "isotropic" is utilized to refer to web properties which are exhibited to substantially equal degrees in all directions within the plane of the matenal. This definition of the term "isotropic" is likewise generally m accordance with the ordinary meaning of the term as evidenced by the corresponding definition in Webster's Ninth New Collegiate Dictionary. Without wishing to be bound by theory, this is presently believed to be due to the non-ordered, non-oπented arrangement of the three-dimensional protrusions within the amorphous pattern. Conversely, directional web mateπals exhibiting web properties which vary by web direction will typically exhibit such properties in similar fashion following the introduction of the amorphous pattern upon the matenal. By way of example, such a sheet of material could exhibit substantially uniform tensile properties in any direction within the plane of the matenal if the starting matenal was isotropic in tensile properties. Such an amorphous pattern m the physical sense translates into a statistically equivalent number of protrusions per unit length measure encountered by a line drawn in any given direction outwardly as a ray from any given point within the pattern Other statistically equivalent parameters could include number of protrusion walls, average protrusion area, average total space between protrusions, etc. Statistical equivalence in terms of structural geometπcal features with regard to directions in the plane of the web is believed to translate into statistical equivalence in terms of directional web properties. Revisiting the array concept to highlight the distinction between arrays and amorphous patterns, since an array is by definition "ordered" in the physical sense it would exhibit some regularity in the size, shape, spacing, and/or onentation of protrusions. Accordingly, a line or ray drawn from a given point in the pattern would yield statistically different values depending upon the direction m which the ray extends for such parameters as number of protrusion walls, average protrusion area, average total space between protrusions, etc. with a corresponding vanation in directional web properties. Within the preferred amorphous pattern, protrusions will preferably be non-uniform with regard to their size, shape, onentation with respect to the web, and spacing between adjacent protrusion centers. Without wishing to be bound by theory, differences in center-to-center spacing of adjacent protrusions are believed to play an important role in reducing the likelihood of nesting occurring in the face-to-back nesting scenario Differences in center-to-center spacing of protrusions in the pattern result m the physical sense in the spaces between protrusions being located in different spatial locations with respect to the overall web Accordingly, the likelihood of a "match" occurnng between supeπmposed portions of one or more webs m terms of protrusions/space locations is quite low. Further, the likelihood of a "match" occurnng between a plurality of adjacent protrusions/spaces on supenmposed webs or web portions is even lower due to the amorphous nature of the protrusion pattern. In a completely amorphous pattern, as would be presently preferred, the center-to-center spacing is random, at least within a designer-specified bounded range, such that there is an equal likelihood of the nearest neighbor to a given protrusion occurnng at any given angular position within the plane of the web. Other physical geometrical characteπstics of the web are also preferably random, or at least non-uniform, within the boundary conditions of the pattern, such as the number of sides of the protrusions, angles included withm each protrusion, size of the protrusions, etc. However, while it is possible and m some circumstances desirable to have the spacing between adjacent protrusions be non-uniform and/or random, the selection of polygon shapes which are capable of interlocking together makes a uniform spacing between adjacent protrusions possible. This is particularly useful for some applications of the three-dimensional, nesting-resistant sheet mateπals of the present invention, as will be discussed hereafter. As used herein, the term "polygon" (and the adjective form "polygonal") is utilized to refer to a two-dimensional geometncal figure with three or more sides, since a polygon with one or two sides would define a line. Accordingly, triangles, quadnlaterals, pentagons, hexagons, etc. are included withm the term "polygon", as would curvilinear shapes such as circles, ellipses, etc. which would have an infinite number of sides. When descπbing properties of two-dimensional structures of non-uniform, particularly non-circular, shapes and non-uniform spacing, it is often useful to utilize "average" quantities and/or "equivalent" quantities. For example, m terms of characteπzing linear distance relationships between objects m a two-dimensional pattern, where spacings on a center-to-center basis or on an individual spacing basis, an "average" spacing term may be useful to characteπze the resulting structure. Other quantities that could be descπbed m terms of averages would include the proportion of surface area occupied by objects, object area, object circumference, object diameter, etc. For other dimensions such as object circumference and object diameter, an approximation can be made for objects which are non-circular by constructing a hypothetical equivalent diameter as is often done m hydraulic contexts. A totally random pattern of three-dimensional hollow protrusions in a web would, in theory, never exhibit face-to-back nesting since the shape and alignment of each frustum would be unique. However, the design of such a totally random pattern would be very time-consuming and complex proposition, as would be the method of manufactunng a suitable forming structure. In accordance with the present invention, the non-nesting attributes may be obtained by designing patterns or structures where the relationship of adjacent cells or structures to one another is specified, as is the overall geometπcal character of the cells or structures, but wherein the precise size, shape, and onentation of the cells or structures is non-uniform and non-repeating The term "non-repeating", as utilized herein, is intended to refer to patterns or structures where an identical structure or shape is not present at any two locations withm a defined area of interest. While there may be more than one protrusion of a given size and shape within the pattern or area of interest, the presence of other protrusions around them of non-uniform size and shape virtually eliminates the possibility of an identical grouping of protrusions being present at multiple locations. Said differently, the pattern of protrusions is non-uniform throughout the area of interest such that no grouping of protrusions withm the overall pattern will be the same as any other like grouping of protrusions. The beam strength of the three-dimensional sheet matenal will prevent significant nesting of any region of matenal surrounding a given protrusion even in the event that that protrusion finds itself supenmposed over a single matching depression since the protrusions surrounding the single protrusion of interest will differ in size, shape, and resultant center-to-center spacing from those surrounding the other protrusion/depression. Professor Davies of the University of Manchester has been studying porous cellular ceramic membranes and, more particularly, has been generating analytical models of such membranes to permit mathematical modeling to simulate real-world performance. This work was descnbed in greater detail in a publication entitled "Porous cellular ceramic membranes: a stochastic model to descnbe the structure of an anodic oxide membrane", authored by J. Broughton and G. A. Davies, which appeared in the Journal of Membrane Science, Vol. 106 (1995), at pp. 89-101, the disclosure of which is hereby incorporated herein by reference. Other related mathematical modeling techniques are descnbed in greater detail in "Computing the n- dimensional Delaunay tessellation with application to Voronoi polytopes", authored by D F Watson, which appeared m The Computer Journal. Vol. 24, No. 2 (1981), at pp. 167-172, and "Statistical Models to Descnbe the Structure of Porous Ceramic Membranes", authored by J. F F. Lim, X. Jia, R. Jaffera , and G. A. Davies, which appeared in Separation Science and Technology, 28(1-3) (1993) at pp 821-854, the disclosures of both of which are hereby incorporated herein by reference. As part of this work, Professor Davies developed a two-dimensional polygonal pattern based upon a constrained Voronoi tessellation of 2-space. In such a method, again with reference to the above-identified publication, nucleation points are placed m random positions in a bounded (pre-determ ed) plane which are equal in number to the number of polygons desired in the finished pattern. A computer program "grows" each point as a circle simultaneously and radially from each nucleation point at equal rates. As growth fronts from neighboπng nucleation points meet, growth stops and a boundary line is formed. These boundary lines each form the edge of a polygon, with vertices formed by intersections of boundary lines. While this theoretical background is useful in understanding how such patterns may be generated and the properties of such patterns, there remains the issue of performing the above numencal repetitions step-wise to propagate the nucleation points outwardly throughout the desired field of interest to completion. Accordingly, to expeditiously carry out this process a computer program is preferably written to perform these calculations given the appropnate boundary conditions and input parameters and deliver the desired output. The first step in generating a pattern m accordance with the present invention is to establish the dimensions of the desired pattern. For example, if it is desired to construct a pattern 10 inches wide and 10 inches long, for optionally forming into a drum or belt as well as a plate, then an X-Y coordinate system is established with the maximum X dimension (x m a χ ) being 10 inches and the maximum Y dimension (y ma χ) being 10 inches (or vice-versa). After the coordinate system and maximum dimensions are specified, the next step is to determine the number of "nucleation points" which will become polygons desired withm the defined boundaπes of the pattern. This number is an integer between 0 and infinity, and should be selected with regard to the average size and spacing of the polygons desired in the finished pattern. Larger numbers correspond to smaller polygons, and vice-versa. A useful approach to determining the appropnate number of nucleation points or polygons is to compute the number of polygons of an artificial, hypothetical, uniform size and shape that would be required to fill the desired forming structure. If this artificial pattern is an array of regular hexagons 30 (see Figure 5), with D being the edge-to-edge dimension and M being the spacing between the hexagons, then the number density of hexagons, N, is: It has been found that using this equation to calculate a nucleation density for the amorphous patterns generated as descπbed herein will give polygons with average size closely approximating the size of the hypothetical hexagons (D). Once the nucleation density is known, the total number of nucleation points to be used in the pattern can be calculated by multiplying by the area of the pattern (80 in 2 in the case of this example). A random number generator is required for the next step. Any suitable random number generator known to those skilled in the art may be utilized, including those requiπng a "seed number" or utilizing an objectively determined starting value such as chronological time. Many random number generators operate to provide a number between zero and one ( 0 - 1 ), and the discussion hereafter assumes the use of such a generator A generator with diffenng output may also be utilized if the result is converted to some number between zero and one or if appropnate conversion factors are utilized. A computer program is wntten to run the random number generator the desired number of iterations to generate as many random numbers as is required to equal twice the desired number of "nucleation points" calculated above. As the numbers are generated, alternate numbers are multiplied by either the maximum X dimension or the maximum Y dimension to generate random pairs of X and Y coordinates all having X values between zero and the maximum X dimension and Y values between zero and the maximum Y dimension. These values are then stored as pairs of (X,Y) coordinates equal in number to the number of "nucleation points". It is at this point, that the invention descπbed herein differs from the pattern generation algorithm descπbed m the previous McGuire et al. application. Assuming that it is desired to have the left and πght edge of the pattern "mesh", 1 e., be capable of being "tiled" together, a border of width B is added to the πght side of the 10" square (see Figure 6). The size of the required border is dependent upon the nucleation density; the higher the nucleation density, the smaller is the required border size. A convenient method of computing the border width, B, is to refer again to the hypothetical regular hexagon array descπbed above and shown in Figure 5. In general, at least three columns of hypothetical hexagons should be incorporated into the border, so the border width can be calculated as: B = 3(D + H) Now, any nucleation point P with coordinates (x,y) where x<B will be copied into the border as another nucleation point, P',wιth a new coordinate (X m _ x + x,y). If the method described m the preceding paragraphs is utilized to generate a resulting pattern, the pattern will be truly random. This truly random pattern will, by its nature, have a large distribution of polygon sizes and shapes which may be undesirable in some instances. In order to provide some degree of control over the degree of randomness associated with the generation of "nucleation point" locations, a control factor or "constraint" is chosen and referred to hereafter as β (beta). The constraint limits the proximity of neighbonng nucleation point locations through the introduction of an exclusion distance, E, which represents the minimum distance between any two adjacent nucleation points. The exclusion distance E is computed as follows: 2β E = ■ < λπ where λ (lambda) is the number density of points (points per unit area) and β ranges from 0 to 1. To implement the control of the "degree of randomness", the first nucleation point is placed as descnbed above, β is then selected, and E is calculated from the above equation. Note that β, and thus E, will remain constant throughout the placement of nucleation points. For every subsequent nucleation point (x,y) coordinate that is generated, the distance from this point is computed to every other nucleation point that has already been placed. If this distance is less than E for any point, the newly-generated (x,y) coordinates are deleted and a new set is generated. This process is repeated until all N points have been successfully placed. Note that m the tiling algonthm of the present invention, for all points (x,y) where x<B, both the onginal point P and the copied point P' must be checked against all other points. If either P or P' is closer to any other point than E, then both P and P' are deleted, and a new set of random (x,y) coordinates is generated. If β=0, then the exclusion distance is zero, and the pattern will be truly random. If β= 1 , the exclusion distance is equal to the nearest neighbor distance for a hexagonally close-packed array. Selecting β between 0 and 1 allows control over the "degree of randomness" between these two extremes. In order to make the pattern a tile in which both the left and πght edges tile properly and the top and bottom edges tile properly, borders will have to be used in both the X and Y directions. Once the complete set of nucleation points are computed and stored, a Delaunay triangulation is performed as the precursor step to generating the finished polygonal pattern. The use of a Delaunay tnangulation in this process constitutes a simpler but mathematically equivalent alternative to iteratively "growing" the polygons from the nucleation points simultaneously as circles, as descnbed the theoretical model above. The theme behind performing the tnangulation is to generate sets of three nucleation points forming angles, such that a circle constructed to pass through those three points will not include any other nucleation points within the circle. To perform the Delaunay tnangulation, a computer program is wntten to assemble every possible combination of three nucleation points, with each nucleation point being assigned a unique number (integer) merely for identification purposes. The radius and center point coordinates are then calculated for a circle passing through each set of three tπangularly- arranged points. The coordinate locations of each nucleation point not used to define the particular triangle are then compared with the coordinates of the circle (radius and center point) to determine whether any of the other nucleation points fall within the circle of the three points of interest. If the constructed circle for those three points passes the test (no other nucleation points falling within the circle), then the three point numbers, their X and Y coordinates, the radius of the circle, and the X and Y coordinates of the circle center are stored. If the constructed circle for those three points fails the test, no results are saved and the calculation progresses to the next set of three points. Once the Delaunay tnangulation has been completed, a Voronoi tessellation of 2-space is then performed to generate the finished polygons. To accomplish the tessellation, each nucleation point saved as being a vertex of a Delaunay tπangle forms the center of a polygon. The outline of the polygon is then constructed by sequentially connecting the center points of the circumscnbed circles of each of the Delaunay triangles, which include that vertex, sequentially in clockwise fashion. Saving these circle center points in a repetitive order such as clockwise enables the coordinates of the vertices of each polygon to be stored sequentially throughout the field of nucleation points. In generating the polygons, a companson is made such that any tnangle vertices at the boundaπes of the pattern are omitted from the calculation since they will not define a complete polygon. If it is desired for ease of tiling multiple copies of the same pattern together to form a larger pattern, the polygons generated as a result of nucleation points copied into the computational border may be retained as part of the pattern and overlapped with identical polygons m an adjacent pattern to aid m matching polygon spacing and registry Alternatively, as shown in Figures 3 and 4, the polygons generated as a result of nucleation points copied into the computational border may be deleted after the tnangulation and tessellation are performed such that adjacent patterns may be abutted with suitable polygon spacing. Once a finished pattern of interlocking polygonal two-dimensional shapes is generated, in accordance with the present invention such a network of interlocking shapes is utilized as the design for one web surface of a web of matenal with the pattern defining the shapes of the bases of the three-dimensional, hollow protrusions formed from the initially planar web of starting matenal. In order to accomplish this formation of protrusions from an initially planar web of starting material, a suitable forming structure compnsmg a negative of the desired finished three- dimensional structure is created which the starting matenal is caused to conform to by exerting suitable forces sufficient to permanently deform the starting matenal. From the completed data file of polygon vertex coordinates, a physical output such as a line drawing may be made of the finished pattern of polygons. This pattern may be utilized in conventional fashion as the input pattern for a metal screen etching process to form a three- dimensional forming structure. If a greater spacing between the polygons is desired, a computer program can be wntten to add one or more parallel lines to each polygon side to increase their width (and hence decrease the size of the polygons a corresponding amount). While particular embodiments of the present invention have been illustrated and descnbed, it will be obvious to those skilled in the art that vanous changes and modifications may be made without departing from the spiπt and scope of the invention, and it is intended to cover in the appended claims all such modifications that are within the scope of the invention.

Claims: WHAT IS CLAIMED IS: 1. A method of creating an amorphous two-dimensional pattern of interlocking two- dimensional geometπcal shapes having at least two opposing edges which can be tiled together, said method compπsing the steps of: (a) specifying the width x^ of said pattern measured in direction x between said opposing edges; (b) adding a computational border region of width B to said pattern along one of said edges located at the x distance X ma -; (c) computationally generating (x,y) coordinates of a nucleation point having x coordinates between 0 and x^; (d) selecting nucleation points having x coordinates between 0 and B and copying them into said computational border region by adding x,- * - to their x coordinate value; (e) compaπng both the computationally generated nucleation point and the corresponding copied nucleation point in said computational border against all previously generated nucleation points; and (f) repeating steps (c) through (e) until the desired number of nucleation points has been generated. . The method of Claim 1, wherein said pattern includes at least two pairs of opposing edges, each pair of opposing edges being capable of being tiled together. . The method of Claim 1, further compnsmg the steps of: (g) performing a Delaunay tπangulation on said nucleation points; and (h) performing a Voronoi tessellation on said nucleation points to form said two- dimensional geometncal shapes. . The method of Claim 1, wherein said pattern includes two mutually orthogonal coordinate directions x and y, and wherein nucleation points are copied into a computational border in each coordinate direction. . The method of Claim 1, wherein said step of comparing said nucleation points includes a control factor to control the degree of randomness of said pattern. The method of Claim 1 , wherein the width B of said computational border is at least equal to the width of three columns of hypothetical hexagons. The method of Claim 1, wherein said method includes the step of generating two- dimensional geometπcal shapes from said nucleation points. The method of Claim 7, wherein said method includes the step of deleting two- dimensional geometπcal shapes resulting from copied nucleation points. The method of Claim 7, wherein said method includes the step of saving two-dimensional geometncal shapes resulting from copied nucleation points. The method of Claim 7, wherein said method includes the step of generating a physical output of the finished pattern of two-dimensional geometncal shapes.

Inventors: MCGUIRE KENNETH STEPHEN, MCGUIRE, KENNETH, STEPHEN
Applicants: PROCTER & GAMBLE, THE PROCTER & GAMBLE COMPANY
Application year: 2000
Main classification: B31F1
IPC codes: B31F1, B44C3, D21H27, G06F17, G06T11