Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
177 words
A method for automatically generating a digital halftone screen at an angle to a Cartesian coordinate system used for scanning and recording, the screen being composed of a plurality of repetitive screen tiles, the screen having a desired screen pitch "p" and ideal screen angle "s", and each tile containing an integer number, "N", of screen dots along a side of the tile in a direction of screen pitch measurement, the method comprising the steps of selecting integers "a", "b", and "N" for providing a screen angle error, equal to the magnitude of ((arctan (a/b))-s), less than a selected threshold and yielding the desired screen pitch, automatically generating a screen tile boundary configuration in response to values of "a" and "b", automatically assigning each pixel within said tile boundary to be associated with a selected one of said screen dots, generating threshold data, in response to said assigning step, representing a screen signal threshold value for each pixel of the tile; and generating an angled halftone digital screen using said threshold data in said Cartesian coordinate system.
Claim 2
Independent Claim
177 words
A method for automatically generating a digital halftone screen at an angle to a Cartesian coordinate system used for scanning and recording, the screen being composed of a plurality of repetitive screen tiles, the screen having a desired screen pitch "p" and ideal screen angle "s", and each tile containing an integer number, "N", of screen dots along a side of the tile in a direction of screen pitch measurement, the method comprising the steps of selecting integers "a", "b", and "N" for providing a screen angle error, equal to the magnitude of ((arctan (a/b))-s), less than a selected threshold and yielding the desired screen pitch, automatically generating a screen tile boundary configuration in response to values of "a" and "b", automatically assigning each pixel within said tile boundary to be associated with a selected one of said screen dots, generating threshold data, in response to said assigning step, representing a screen signal threshold value for each pixel of the tile; and generating an angled halftone digital screen using said threshold data in said Cartesian coordinate system.
Claim 3
Dependent Claim
87 words
The method of claim 1 wherein said assigning step comprises the steps of selecting centers for each of the screen dots within the tile; selecting pixels for approximating the center of each said screen dot; selecting from available pixels within said tile boundary, for each dot, a best fitting pixel for assignment to each said screen dot and assigning said selected pixel to said screen dot; and repeating said available pixel selecting step until all pixels within the tile boundary have been assigned to said screen dots.
Claim 4
Dependent Claim
40 words
The method of claim 2 wherein said repeating step comprises the step of sequentially performing said available pixel selecting step for all pixels assigned to one screen dot before performing said available pixel selecting step for a next screen dot.
Claim 5
Dependent Claim
48 words
The method of claim 3 wherein said repeating step comprises the step of selecting a said pixel for a said screen dot and thereafter selecting a said pixel for a different screen dot, whereby all screen dots are grown at a substantially equivalent rate and size in parallel.
Claim 6
Independent Claim
189 words
A method for automatically generating a digital halftone screen at an angle to a Cartesian coordinate system used for scanning and recording, the screen being composed of a plurality of repetitive screen tiles, the screen having a desired screen pitch "p" and ideal screen angle "s", and each tile containing an integer number, "N", of screen dots along a side of the tile in a direction of screen pitch measurement, the method comprising the steps of selecting integers "a", "b", and "N" for providing a screen angle error, equal to the magnitude of ((arctan (a/b))-s), less than a selected threshold and yielding the desired screen pitch, automatically generating a screen tile boundary configuration in response to values of "a" and "b", automatically assigning each pixel within said tile boundary to be associated with a selected one of said screen dots, storing said pixel associations in a mapping array, generating a threshold array in response to said assigning step having elements representing a screen signal threshold value for each pixel of the tile; and generating an angled halftone digital screen using said threshold array data in said Cartesian coordinate system.
Claim 7
Independent Claim
189 words
A method for automatically generating a digital halftone screen at an angle to a Cartesian coordinate system used for scanning and recording, the screen being composed of a plurality of repetitive screen tiles, the screen having a desired screen pitch "p" and ideal screen angle "s", and each tile containing an integer number, "N", of screen dots along a side of the tile in a direction of screen pitch measurement, the method comprising the steps of selecting integers "a", "b", and "N" for providing a screen angle error, equal to the magnitude of ((arctan (a/b))-s), less than a selected threshold and yielding the desired screen pitch, automatically generating a screen tile boundary configuration in response to values of "a" and "b", automatically assigning each pixel within said tile boundary to be associated with a selected one of said screen dots, storing said pixel associations in a mapping array, generating a threshold array in response to said assigning step having elements representing a screen signal threshold value for each pixel of the tile; and generating an angled halftone digital screen using said threshold array data in said Cartesian coordinate system.
Claim 8
Dependent Claim
145 words
The method of claim 5 wherein said assigning step comprises the steps of selecting centers for each of the screen dots within the tile; initializing a candidate list for each screen dot for recording pixels available for inclusion in said each screen dot; selecting pixels for approximating the center of each said screen dot; adding to said candidate list of a said screen dot, pixels adjacent to said selected center pixel for said screen dot; selecting, from the candidate list for each dot, a best fitting pixel for assignment to each said selected screen dot and assigning said selected pixel to said screen dot; adding to said candidate list, pixels horizontally and vertically adjacent to a last selected pixel; prioritizing each said candidate list; and repeating said pixel selecting and adding steps until all pixels within the tile have been assigned to said screen dots.
Claim 9
Dependent Claim
47 words
The method of claim 6 wherein said storing step comprises the steps of assigning, to each of said pixels contained in said screen tile, a screen dot identifier; and storing the screen dot identifier in said mapping array at a location corresponding to said pixel being selected.
Claim 10
Dependent Claim
38 words
The method of claim 7 wherein said threshold array generating step comprises the step of assigning threshold values in said threshold array for each pixel of a tile, said threshold values corresponding to screen signal dither threshold levels.
Claim 11
Dependent Claim
57 words
The method of claim 5 wherein said threshold array generating step further comprises the step of basing said screen signal threshold value for a selected pixel on an order in which said pixel was selected for inclusion in said screen dot, each succeeding pixel being assigned an incrementally different dither threshold value than a previously selected pixel.
Claim 12
Dependent Claim
36 words
The method of claim 2 wherein said available pixel selecting step comprises the step of selecting a pixel located nearest to a last chosen pixel if two or more pixel candidates have a same highest priority.
Claim 13
Dependent Claim
47 words
The method of claim 2 wherein said available pixel selecting step further, comprises the step of selecting a pixel minimizing an RMS error of a resulting dot with respect to an ideal dot model being employed if two or more pixel candidates have a same highest priority.
Claim 14
Dependent Claim
30 words
The method of claim 5 wherein said assigning step for pixel selection comprises the step of proceeding in parallel for all of the screen dots contained within the tile boundary.
Claim 15
Dependent Claim
39 words
The method of claim 2 wherein said available pixel selecting step further comprises the step of selecting the pixel which minimizes the error associated with aligning neighboring dots, if two or more pixel candidates have a same highest priority.
Claim 16
Dependent Claim
50 words
The method of claim 6 further wherein said assigning step comprises the step of choosing a next pixel on said list, if the pixel chosen from the candidate list has already been assigned to another screen dot, until either an unused pixel is chosen or the candidate list is exhausted.
Claim 17
Dependent Claim
20 words
The method of claim 5 further comprising the step of providing a tile having "N" screen dots along each side.
Claim 18
Dependent Claim
46 words
The method of claim 1 further comprising the step of receiving, from a data source, Cartesian coordinate data, and recording said Cartesian coordinate data on a recording medium using a scanning line moving at an angle to said ideal screen angle and using the threshold data.
Claim 19
Dependent Claim
19 words
The method of claim 1 further comprising the step of tiling a plane using said screen tile boundary configuration.
Claim 20
Dependent Claim
50 words
The method of claim 2 wherein the step of selecting from available pixels comprises the steps of determining how many exposed pixel edges result from adding a pixel to a said screen dot, and using said resulting exposed pixel edges in determining whether the pixel is a best fitting pixel.