US 6,421,052 B1Grant
Method of seaming and expanding amorphous patterns
Issue Date:2002-07-16
•10 Claims
•6 Drawing Sheets
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 portion 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 xmaxof 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 xmaxto 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 computational borders in two mutually orthogonal coordinate directions.
Metadata
Assignee
- The Procter & Gamble Company
Inventor
- Kenneth S. McGuire
Application Information
Application Number:US 09/288,736
Filing Date:1999-04-09
Priority Date:1999-04-09
Art Unit:7
Classifications
IPC:
G06T 1120G06T 1720
Field of Search:
345441345423345430345620345624
Patent Drawings (6 sheets)
Description
Field of the Invention
[0002] The present invention relates to amorphous patterns useful in manufacturing three-dimensional sheet materials that resist nesting of superimposed 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
[0003] The use of amorphous patterns for the prevention of nesting in wound rolls of three dimensional sheet products has been disclosed in commonly-assigned, co-pending (allowed) U.S. patent application Ser. No. 08/745,339, filed Nov. 8, 1996 in the names of McGuire, Tweddell, and Hamilton, entitled “Three-Dimensional, Nesting-Resistant Sheet Materials 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.
[0004] The patterns created using the method described in the above mentioned application work quite well for flat, small materials. However, when one tries 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 comprising 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.
[0005] 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
[0006] 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 portion of the algorithm.
[0007] 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 xmaxof 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 xmaxto 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.
[0008] 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 computational borders in two mutually orthogonal coordinate directions.
Brief Description of the Drawings
[0009] 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 description of preferred embodiments, taken in conjunction with the accompanying drawings, in which like reference numerals identify identical elements and wherein:
[0010] FIG. 1 is a plan view of four identical “tiles” of a representative prior art amorphous pattern;
[0011] FIG. 2 is a plan view of the four prior art “tiles” of FIG. 1 moved into closer proximity to illustrate the mismatch of the pattern edges;
[0012] FIG. 3 is a plan view similar to FIG. 1 of four identical “tiles” of a representative embodiment of an amorphous pattern in accordance with the present invention;
[0013] FIG. 4 is a plan view similar to FIG. 2 of the four “tiles” of FIG. 3 moved into closer proximity to illustrate the matching of the pattern edges;
[0014] FIG. 5 is a schematic illustration of dimensions referenced in the pattern generation equations of the present invention; and
[0015] FIG. 6 is a schematic illustration of dimensions referenced in the pattern generation equations of the present invention.
Detailed Description of the Invention
[0016] FIG. 1 is an example of a pattern 10 created using the algorithm described in the previously referenced McGuire et al. application. Included in FIG. 1 are four identical “tiles” of the pattern 10 which have identical dimensions and are oriented in an identical fashion. If an attempt is made to “tile” this pattern, as shown in FIG. 2, by bringing the “tiles” 10 into closer proximity to form a larger pattern, obvious seams appear at the border of adjacent tiles or pattern elements. Such scams are visually distracting from the amorphous nature of the pattern and, in the case of a three-dimensional material made from a forming structure using such a pattern, the scams create disturbances in the physical properties of the material at the seam locations. Since the tiles 10 are identical, the seams created by bringing 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.
[0017] In contrast, FIGS. 3 and 4 show similar views of a pattern 20 created using the algorithm of the present invention, as described below. It is obvious from FIGS. 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.
[0018] As utilized herein, the tern “amorphous” refers to a pattern which exhibits no readily perceptible organization, regularity, 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.
[0019] 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 in 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 orientation and arrangement of one element with regard to a neighboring element bear a predictable relationship to that of the next succeeding element(s) beyond.
[0020] The degree to which order is present in an array pattern of three-dimensional protrusions bears a direct relationship to the degree of nestability exhibited by the web. For example, in 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 in fact the entire web, can be achieved with a web alignment shift between superimposed webs or web portions of no more than one protrusion-spacing 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 nestability. Accordingly, an amorphous, non-order-ed pattern of protrusions would therefore exhibit the greatest possible degree of nesting-resistance.
[0021] Three-dimensional sheet materials having a two-dimensional pattern of three-dimensional protrusions which is substantially amorphous in 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 geometrical and structural properties for a given circumscribed area wherever such an area is delineated within the pattern. This definition of the tern “isomorphic” is generally in accordance with the ordinary meaning of the tern as evidenced by the corresponding definition in Webster's Ninth New Collegiate Dictionary. By way of example, a prescribed area comprising 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.
[0022] Utilization of an amorphous pattern of three-dimensional protrusions has other advantages as well. For example, it has been observed that three-dimensional sheet materials formed from a material which is initially isotropic within the plane of the material remain generally isotropic with respect to physical web properties in directions within the plane of the material. As utilized herein, the tern “isotropic” is utilized to refer to web properties which are exhibited to substantially equal degrees in all directions within the plane of the material. This definition of the term “isotropic” is likewise generally in accordance with the ordinary meaning of the tern 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-oriented arrangement of the three-dimensional protrusions within the amorphous pattern. Conversely, directional web materials 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 material. By way of example, such a sheet of material could exhibit substantially uniform tensile properties in any direction within the plane of the material if the starting material was isotropic in tensile properties.
[0023] Such an amorphous pattern in 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 geometrical features with regard to directions in the plane of the web is believed to translate into statistical equivalence in terms of directional web properties.
[0024] 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 orientation of protrusions. Accordingly, a line or ray drawn from a given point in the pattern would yield statistically different values depending upon the direction in which the ray extends for such parameters as number of protrusion walls, average protrusion area, average total space between protrusions, etc. with a corresponding variation in directional web properties.
[0025] Within the preferred amorphous pattern, protrusions will preferably be non-uniform with regard to their size, shape, orientation 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 ail 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 in 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” occurring between superimposed portions of one or more webs in terms of protrusions/space locations is quite low. Further, the likelihood of a “match” occurring between a plurality of adjacent protrusions/spaces on superimposed webs or web portions is even lower due to the amorphous nature of the protrusion pattern.
[0026] 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 occurring at any given angular position within the plane of the web. Other physical geometrical characteristics 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 within each protrusion, size of the protrusions, etc. However, while it is possible and in 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 materials of the present invention, as will be discussed hereafter.
[0027] As used herein, the term “polygon” (and the adjective form “polygonal”) is utilized to refer to a two-dimensional geometrical figure with three or more sides, since a polygon with one or two sides would define a line. Accordingly, triangles, quadrilaterals, pentagons, hexagons, etc. are included within the term “polygon”, as would curvilinear shapes such as circles, ellipses, etc. which would have an infinite number of sides.
[0028] When describing 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, in terms of characterizing linear distance relationships between objects in a two-dimensional pattern, where spacings on a center-to-center basis or on an individual spacing basis, an “average” spacing tern may be useful to characterize the resulting structure. Other quantities that could be described in 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 in hydraulic contexts.
[0029] 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 manufacturing 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 geometrical character of the cells or structures, but wherein the precise size, shape, and orientation 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 within 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 within the overall pattern will be the same as any other like grouping of protrusions. The beam strength of the three-dimensional sheet material will prevent significant nesting of any region of material surroundinig a given protrusion even in the event that that protrusion finds itself superimposed 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.
[0030] 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 described in greater detail in a publication entitled “Porous cellular ceramic membranes: a stochastic model to describe 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 described in greater detail in “Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes”, authored by D. F. Watson, which appeared in The Computer Journal, Vol. 24, No. 2 (1981), at pp. 167-172, and “Statistical Models to Describe the Structure of Porous Ceramic Membranes”, authored by J. F. F. Lim, X. Jia, R. Jafferali, 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.
[0031] 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 in random positions in a bounded (pre-determined) 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 neighboring 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.
[0032] 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 numerical 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 appropriate boundary conditions and input parameters and deliver the desired output.
[0033] The first step in generating a pattern in 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 (xmax) being 10 inches and the maximum Y dimension (ymax) being 10 inches (or vice-versa).
[0034] 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 within the defined boundaries 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 appropriate 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 FIG. 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:
[0035] It has been found that using this equation to calculate a nucleation density for the amorphous patterns generated as described 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 in2in the case of this example).
[0036] 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 requiring 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 differing output may also be utilized if the result is converted to some number between zero and one or if appropriate conversion factors are utilized.
[0037] A computer program is written 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”.
[0038] It is at this point, that the invention described herein differs from the pattern generation algorithm described in the previous McGuire et al. application. Assuming that it is desired to have the left and right edge of the pattern “mesh”, i.e., be capable of being “tiled” together, a border of width B is added to the right side of the 10″ square (see FIG. 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 described above and shown in FIG. 5. In general, at least three columns of hypothetical hexagons should be incorporated into the border, so the border width can be calculated as:
[0039] B=3(D +H)
[0040] Now, any nucleation point P with coordinates (x,y) where x<B will be copied into the border as another nucleation point, P′, with a new coordinate (xmax+x,y).
[0041] If the method described in 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 neighboring 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:
[0042] where λ (lambda) is the number density of points (points per unit area) and β ranges from 0 to 1.
[0043] To implement the control of the “degree of randomness”, the first nucleation point is placed as described 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 in the tiling algorithm of the present invention, for all points (x,y) where x<B, both the original 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.
[0044] 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.
[0045] In order to make the pattern a tile in which both the left and right edges tile properly and the top and bottom edges tile properly, borders will have to be used in both the X and Y directions.
[0046] 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 triangulation in this process constitutes a simpler but mathematically equivalent alternative to iteratively “growing” the polygons from the nucleation points simultaneously as circles, as described in the theoretical model above. The theme behind performing the triangulation is to generate sets of three nucleation points forming triangles, 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 triangulation, a computer program is written 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 triangularly-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.
[0047] Once the Delaunay triangulation 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 triangle forms the center of a polygon. The outline of the polygon is then constructed by sequentially connecting the center points of the circumscribed 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 comparison is made such that any triangle vertices at the boundaries of the pattern are omitted from the calculation since they will not define a complete polygon.
[0048] 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 in an adjacent pattern to aid in matching polygon spacing and registry. Alternatively, as shown in FIGS. 3 and 4, the polygons generated as a result of nucleation points copied into the computational border may be deleted after the triangulation and tessellation are performed such that adjacent patterns may be abutted with suitable polygon spacing.
[0049] 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 material with tile pattern defining the shapes of the bases of the three-dimensional, hollow protrusions formed from the initially planar web of starting material. In order to accomplish this formation of protrusions from an initially planar web of starting material, a suitable forming structure comprising a negative of the desired finished three-dimensional structure is created which the starting material is caused to conform to by exerting suitable forces sufficient to permanently deform the starting material.
[0050] 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 written 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).
[0051] While particular embodiments of the present invention have been illustrated and described, it will be obvious to those skilled in the art that various changes and modifications may be made without departing from the spirit 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
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method of creating an amorphous two-dimensional pattern of interlocking two-dimensional geometrical shapes having at least two opposing edges which can be tiled together, said method comprising the steps of:
(a) specifying the width xmaxof 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 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 said computational border region by adding xmaxto their x coordinate value;
(e) comparing 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.
2. 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.
3. The method of claim 1, further comprising the steps of:
(g) performing a Delaunay triangulation on said nucleation points; and
(h) performing a Voronoi tessellation on said nucleation points to form said two-dimensional geometrical shapes.
4. 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.
5. 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.
6. 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.
7. The method of claim 1, wherein said method includes the step of generating two-dimensional geometrical shapes from said nucleation points.
8. The method of claim 7, wherein said method includes the step of deleting two-dimensional geometrical shapes resulting from copied nucleation points.
9. The method of claim 7, wherein said method includes the step of saving two-dimensional geometrical shapes resulting from copied nucleation points.
10. The method of claim 7, wherein said method includes the step of generating a physical output of the finished pattern of two-dimensional geometrical shapes.
Patent Citations (148)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US680533(A) | 1901-08-01 | Marinier et al. | Applicant |
| US690822(A) | 1902-01-01 | Avril | Applicant |
| US1358891(A) | 1920-11-01 | Steedman | Applicant |
| US1454364(A) | 1923-05-01 | Winchenbaugh et al. | Applicant |
| US2054313(A) | 1936-09-01 | Bright | Applicant |
| US2338749(A) | 1944-01-01 | Wilbur | Applicant |
| US2681612(A) | 1954-06-01 | Reimann | Applicant |
| US2838416(A) | 1958-06-01 | Babiarz et al. | Applicant |
| US2855844(A) | 1958-10-01 | Stewart | Applicant |
| US2861006(A) | 1958-11-01 | Salditt | Applicant |
| US3018015(A) | 1962-01-01 | Agriss et al. | Applicant |
| US3024154(A) | 1962-03-01 | Singleton et al. | Applicant |
| US3312005(A) | 1967-04-01 | McElroy | Applicant |
| US3386846(A) | 1968-06-01 | Lones | Applicant |
| US3484835(A) | 1969-12-01 | Trounstine et al. | Applicant |
| US3554835(A) | 1971-01-01 | Morgan | Applicant |
| US3573136(A) | 1971-03-01 | Gardner | Applicant |
| US3585101(A) | 1971-06-01 | Stratton et al. | Applicant |
| US3592722(A) | 1971-07-01 | Morgan | Applicant |
| US3708366(A) | 1973-01-01 | Donnelly | Applicant |
| US3850095(A) | 1974-11-01 | Snyder | Applicant |
| US3853129(A) | 1974-12-01 | Kozak | Applicant |
| US3867225(A) | 1975-02-01 | Nystrand | Applicant |
| US3879330(A) | 1975-04-01 | Lustig | Applicant |
| US3901237(A) | 1975-08-01 | Cepuritis et al. | Applicant |
| US3911187(A) | 1975-10-01 | Raley | Applicant |
| US3937221(A) | 1976-02-01 | Tritsch | Applicant |
| US3943609(A) | 1976-03-01 | Egan, Jr. | Applicant |
| US3950480(A) | 1976-04-01 | Adams et al. | Applicant |
| US3967624(A) | 1976-07-01 | Milnamow | Applicant |
| US4023570(A) | 1977-05-01 | Chinal et al. | Applicant |
| US4054697(A) | 1977-10-01 | Reed et al. | Applicant |
| US4061820(A) | 1977-12-01 | Magid et al. | Applicant |
| US4067337(A) | 1978-01-01 | Ness | Applicant |
| US4133152(A) | 1979-01-01 | Penrose | Applicant |
| US4181752(A) | 1980-01-01 | Martens et al. | Applicant |
| US4273889(A) | 1981-06-01 | Yamazaki et al. | Applicant |
| US4303485(A) | 1981-12-01 | Levens | Applicant |
| US4325768(A) | 1982-04-01 | Schulz | Applicant |
| US4336804(A) | 1982-06-01 | Roeder | Applicant |
| US4337772(A) | 1982-07-01 | Roeder | Applicant |
| US4339088(A) | 1982-07-01 | Niedermeyer | Applicant |
| US4342314(A) | 1982-08-01 | Radel et al. | Applicant |
| US4376147(A) | 1983-03-01 | Byrne et al. | Applicant |
| US4376440(A) | 1983-03-01 | Whitehead et al. | Applicant |
| US4392897(A) | 1983-07-01 | Herrington | Applicant |
| US4397905(A) | 1983-08-01 | Detmer et al. | Applicant |
| US4404242(A) | 1983-09-01 | Squier | Applicant |
| US4405666(A) | 1983-09-01 | Squier | Applicant |
| US4410130(A) | 1983-10-01 | Herrington | Applicant |
| US4413109(A) | 1983-11-01 | Haas | Applicant |
| US4460634(A) | 1984-07-01 | Hasegawa | Applicant |
| US4508256(A) | 1985-04-01 | Radel et al. | Applicant |
| US4509908(A) | 1985-04-01 | Mullane, Jr. | Applicant |
| US4514345(A) | 1985-04-01 | Johnson et al. | Applicant |
| US4519095(A) | 1985-05-01 | Clayton | Applicant |
| US4528239(A) | 1985-07-01 | Trokhan | Applicant |
| US4543142(A) | 1985-09-01 | Kuepper et al. | Applicant |
| US4546029(A) | 1985-10-01 | Cancio et al. | Applicant |
| US4556595(A) | 1985-12-01 | Ochi | Applicant |
| US4576850(A) | 1986-03-01 | Martens | Applicant |
| US4578069(A) | 1986-03-01 | Whitehead et al. | Applicant |
| US4587152(A) | 1986-05-01 | Gleichenhagen et al. | Applicant |
| US4612221(A) | 1986-09-01 | Biel et al. | Applicant |
| US4655761(A) | 1987-04-01 | Grube et al. | Applicant |
| US4659608(A) | 1987-04-01 | Schulz | Applicant |
| US4695422(A) | 1987-09-01 | Curro et al. | Applicant |
| US4699622(A) | 1987-10-01 | Toussant et al. | Applicant |
| US4743242(A) | 1988-05-01 | Grube et al. | Applicant |
| US4778644(A) | 1988-10-01 | Curro et al. | Applicant |
| US4803032(A) | 1989-02-01 | Schulz | Applicant |
| US4820589(A) | 1989-04-01 | Dobreski et al. | Applicant |
| US4839216(A) | 1989-06-01 | Curro et al. | Applicant |
| US4894275(A) | 1990-01-01 | Pelzar | Applicant |
| US4946527(A) | 1990-08-01 | Battrell | Applicant |
| US4959265(A) | 1990-09-01 | Wood et al. | Applicant |
| US5008139(A) | 1991-04-01 | Ochi et al. | Applicant |
| US5080957(A) | 1992-01-01 | Leseman et al. | Applicant |
| US5098522(A) | 1992-03-01 | Smurkoski et al. | Applicant |
| US5112674(A) | 1992-05-01 | German et al. | Applicant |
| US5116677(A) | 1992-05-01 | Jones | Applicant |
| US5141790(A) | 1992-08-01 | Calhoun et al. | Applicant |
| US5165982(A) | 1992-11-01 | Gubitz et al. | Applicant |
| USD331665(S) | 1992-12-01 | Underhill | Applicant |
| US5175049(A) | 1992-12-01 | Huff et al. | Applicant |
| US5176939(A) | 1993-01-01 | Shepherd | Applicant |
| US5208096(A) | 1993-05-01 | Dohrer | Applicant |
| US5215617(A) | 1993-06-01 | Grupe | Applicant |
| US5215804(A) | 1993-06-01 | Hagens et al. | Applicant |
| US5221276(A) | 1993-06-01 | Battrell | Applicant |
| US5245025(A) | 1993-09-01 | Trokhan et al. | Applicant |
| US5246762(A) | 1993-09-01 | Nakamura | Applicant |
| US5269776(A) | 1993-12-01 | Lancaster et al. | Applicant |
| US5273805(A) | 1993-12-01 | Calhoun et al. | Applicant |
| US5273809(A) | 1993-12-01 | Simmons | Applicant |
| US5275588(A) | 1994-01-01 | Matsumoto et al. | Applicant |
| US5296277(A) | 1994-03-01 | Wilson et al. | Applicant |
| US5300347(A) | 1994-04-01 | Underhill et al. | Applicant |
| US5310587(A) | 1994-05-01 | Akahori et al. | Applicant |
| US5324279(A) | 1994-06-01 | Lancaster et al. | Applicant |
| US5334428(A) | 1994-08-01 | Dobreski et al. | Applicant |
| US5339730(A) | 1994-08-01 | Ruppei et al. | Applicant |
| US5342344(A) | 1994-08-01 | Lancaster et al. | Applicant |
| US5344693(A) | 1994-09-01 | Sanders | Applicant |
| US5382464(A) | 1995-01-01 | Ruppel et al. | Applicant |
| US5428726(A) | 1995-06-01 | Piegl et al. | Examiner |
| US5436057(A) | 1995-07-01 | Schulz | Applicant |
| US5453296(A) | 1995-09-01 | Lauritzen et al. | Applicant |
| US5458938(A) | 1995-10-01 | Nygard et al. | Applicant |
| US5487929(A) | 1996-01-01 | Rusincovitch, Jr. et al. | Applicant |
| US5514122(A) | 1996-05-01 | Morris et al. | Applicant |
| US5518801(A) | 1996-05-01 | Chappell et al. | Applicant |
| US5527112(A) | 1996-06-01 | Dais et al. | Applicant |
| USD373026(S) | 1996-08-01 | Delebreau et al. | Applicant |
| US5550960(A) | 1996-08-01 | Shirman et al. | Examiner |
| US5575747(A) | 1996-11-01 | Dais et al. | Applicant |
| US5585178(A) | 1996-12-01 | Calhoun et al. | Applicant |
| US5589246(A) | 1996-12-01 | Calhoun et al. | Applicant |
| US5597639(A) | 1997-01-01 | Schulz | Applicant |
| US5622106(A) | 1997-04-01 | Rayner | Applicant |
| USD381810(S) | 1997-08-01 | Schultz et al. | Applicant |
| US5662758(A) | 1997-09-01 | Hamilton et al. | Applicant |
| US5686168(A) | 1997-11-01 | Laurent et al. | Applicant |
| US5736223(A) | 1998-04-01 | Laurent | Applicant |
| US5740342(A) | 1998-04-01 | Koeberger | Examiner |
| US5798784(A) | 1998-08-01 | Akiyama | Examiner |
| US5871607(A) | 1999-02-01 | Hamilton et al. | Applicant |
| US5965235(A) | 1999-10-01 | McGuire et al. | Applicant |
| US5965255(A) | 1999-10-01 | McGuire et al. | Examiner |
| US6100893(A) | 2000-08-01 | Ensz et al. | Examiner |
| US6106561(A) | 2000-08-01 | Farmer | Examiner |
| US6148496(A) | 2000-11-01 | McGuire et al. | Examiner |
| US6254965(B1) | 2001-07-01 | McGuire et al. | Examiner |
| BE570960 | 1958-09-01 | Applicant | |
| EP37101 | 1981-10-01 | Applicant | |
| EP621082 | 1994-10-01 | Applicant | |
| EP623332 | 1994-11-01 | Applicant | |
| FR1315903 | 1962-12-01 | Applicant | |
| FR1429312 | 1966-01-01 | Applicant | |
| GB975783 | 1964-11-01 | Applicant | |
| GB1069445 | 1967-05-01 | Applicant | |
| JP3-002292 | 1991-01-01 | Applicant | |
| JP7246216 | 1995-09-01 | Applicant | |
| WO92/00187 | 1992-01-01 | Applicant | |
| WO95/11945 | 1995-05-01 | Applicant | |
| WO95/31225 | 1995-11-01 | Applicant | |
| WO96/31652 | 1996-10-01 | Applicant | |
| WO97/18276 | 1997-05-01 | Applicant |
Non-Patent Literature (4)
- Martin Gardner—“Penrose Tiles ot Trapdoor Ciphers”, Chapter 1 Penrose Tiling, pp. 1-18: (Pub. Mathematical Assn. of America—(1997).Applicant
- Broughton, J., et al., “Porous Cellular Ceramic Membranes: A Stochastic Model To Describe the Structure of an Anodic Oxide Membrane”, Journal of Membrane Science 106, pp. 89-101 (1995).Applicant
- Lim J.H.F., et al., “Statistical Models to Describe the Structure of Porous Ceramic Membranes”, Separation Science and Technology, 28(1-3), pp. 821-854 (1993).Applicant
- Watson, D.F., “Computing the n-dimensional Delaunay Tessellation with Application to Voronol Polytopes”, The Computer Journal, vol. 24, No. 2, pp. 167-172 (1981).Applicant