US5014223A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of filling inner region of a graphic with traces of imaging spot
Assignee: Dainippon Screen Manufacturing Co Ltd
•
Filing: 1989-03-22
•
Granted: 1991-05-07
•
Expires: 2009-03-22
Abstract
Abstract For filling the area bounded by a two-dimensional geographic shape, a so-called graphic, with light from a scanning beam, a reduced size graphic is created within the original graphic. The reduced graphic is divided into convex loops by being divided up along a set of lines which extend parallel to a predetermined direction (Y). The respective longitudinal directions of the convex loops are detected, and then, alternate vectors are generated along the respective longitudinal directions of the convex loops. The scanning beam is moved along the vectors on a photosensitive film, thus filling the inner region of the graphic with the traces of the light beam.
Inventors
- 👤 Masayuki Tanimori
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 16:14
CPC Classifications
G; G06; G06T; G06T11/00; G06T11/40
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
161 words
A method of filling an inner region of a graphic with traces of an imaging spot having a predetermined spot size, on an image plane of said graphic, said method comprising the steps of: (a) preparing graphic data which define border lines of said graphic, (b) on the basis of said graphic data, dividing said graphic into convex loops only along lines which are parallel to a predetermined direction, (c) detecting respective longitudinal directions of said convex loops, (d) with respect to each of said convex loops, generating an array of vectors convering an inner region of each such convex loop, with vectors belonging to said array having components in a longitudinal direction of said convex loop and being spacedly arrayed in a direction transverse to said vectors, the spacing between said vectors corresponding to said spot size, and (e) serially moving said imaging spot on said image plane along said vectors to thereby fill said inner region of said graphic.
Claim 2
Independent Claim
161 words
A method of filling an inner region of a graphic with traces of an imaging spot having a predetermined spot size, on an image plane of said graphic, said method comprising the steps of: (a) preparing graphic data which define border lines of said graphic, (b) on the basis of said graphic data, dividing said graphic into convex loops only along lines which are parallel to a predetermined direction, (c) detecting respective longitudinal directions of said convex loops, (d) with respect to each of said convex loops, generating an array of vectors convering an inner region of each such convex loop, with vectors belonging to said array having components in a longitudinal direction of said convex loop and being spacedly arrayed in a direction transverse to said vectors, the spacing between said vectors corresponding to said spot size, and (e) serially moving said imaging spot on said image plane along said vectors to thereby fill said inner region of said graphic.
Claim 3
Dependent Claim
58 words
The method of claim 1, wherein the step (b) includes the steps of: (b-1) on the basis of said graphic data, generating a reduced graphic which has the shape of said graphic but is reduced in size by a predetermined amount relative to said graphic, (b-2) dividing said reduced graphic along said lines to obtain said convex loops.
Claim 4
Dependent Claim
19 words
The method of claim 2, wherein said predetermined amount is substantially equal to one half of said spot size.
Claim 5
Dependent Claim
57 words
The method of claim 3, wherein the step (b) further includes the steps in: (b-3) detecting the presence of a concavity, if any, in said reduced graphic, (b-4) generating a bridge line for bridging a part of said concavity, and (b-5) replacing said part of said concavity with said bridge line before carrying out the step (b-2).
Claim 6
Dependent Claim
56 words
The method of claim 3, wherein the step (b) further includes the steps of: (b-6) detecting an intercrossing between border lines of said reduced graphic, and (b-7) dividing said reduced graphic into partial graphics at said intercrossing, each of said partial graphics being subjected to the step (b-2) individually in the manner of said reduced graphic.
Claim 7
Dependent Claim
52 words
The method of claim 2, wherein the step (b) includes the steps of: (b-21) generating parallel slit lines passing through respective apices of said reduced graphic, said parallel slit lines being parallel to said predetermined direction, and (b-22) dividing said reduced graphic with said parallel slit lines to generate said convex loops.
Claim 8
Dependent Claim
113 words
The method of claim 2, wherein the step (c) includes the steps of: (c-1) defining a first direction X and a second direction Y in relation to said reduced graphic, where said first direction X is perpendicular to said predetermined direction and said second direction Y is parallel to said predetermined direction, (c-2) detecting respective sizes of said convex loops in said first and second directions, and (c-3) with respect to each of said convex loops, comparing a first size of a convex loop in said first direction X with a second size of said convex loop in said second direction Y, to thereby detect said respective longitudinal directions of said convex loops.
Claim 9
Dependent Claim
133 words
The method of claim 7, wherein the step (d) includes the steps of: (d-1) classifying said convex loops into first and second groups according to said respective longitudinal directions of said convex loops, where first convex loops belonging to said first group have longitudinal directions parallel to said second direction Y and second convex loops belonging to said second group have longitudinal directions not parallel to said second direction Y, (d-2) for each of said first convex loops, generating said array of vectors in which respective directions of vectors are parallel to said second direction Y or parallel to a reverse direction thereof, and (d-3) for each of said second convex loops, generating said array of vectors in which respective directions of vectors are not parallel nor antiparallel to said second direction Y.
Claim 10
Dependent Claim
125 words
The method of claim 8, wherein said first and second convex loops are polygons, and the step (d-3e includes the steps of: (d-31) extracting a trapezoid from said second convex loops, (d-32) dividing said trapezoid into a triangle and a parallelogram, (d-33) generating first alternate vectors which are parallel to longer opposite sides of said parallelogram or parallel to a reverse direction thereof so that an inner region of said parallelogram is covered with said first alternate vectors, and (d-34e generating second alternate vectors which are parallel to a longest side of said triangle so that an inner region of said triangle is covered with said second alternate vectors, said array of vectors for said trapezoid being formed with said first and second alternate vectors.
Claim 11
Dependent Claim
64 words
The method of claim 9, wherein the step (d-3) further includes the step of: (d-35) for each of a plurality of polygons forming said second convex loops, generating an additional vector along a side of a corresponding polygon which is parallel to said second direction Y, and (d-36) for each of said second convex loops, adding said additional vector to said array of vectors.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-05-06 | 1994-11-05 | 1995-05-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-05-06 | 1998-11-05 | 1999-05-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-05-06 | 2002-11-05 | 2003-05-07 | $7700.00 | Window Closed / Lapsed |