Patent US4297525A successfully refreshed from Google Patents.
Patent EP0342752A2 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0342752A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

A computer method and an aparatus for generating a display picture representing a set of object elements including a brush object element

Assignee: Koninklijke Philips NV
•
Filing: 1989-05-16
•
Granted: —
•
Expires: 2009-05-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A computer method and apparatus is disclosed for in a graphics display system combining a brush object element with a trajectory object element. The brush has a reference point that moves along a trajectory, and any point in application coordinates that is at any position covered by the brush, is assigned an -inside- indication. The trajectory may be non-closed or closed, in which latter case it may also govern an -inside- indication. The approach is point driven, which leads itself to acceleration by means of array calculations.

Inventors

  • 👤 Marc Eugeen Adriaan Corthout

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-03 16:56
CPC Classifications
G; G06; G06T; G06T11/00; G06T11/10

Claims Analysis

Total Claims: 29
Claim 1
Independent Claim 432 words
A computer method for pixel-wise generating a display picture representing an object set of object elements, including a brush object element that is a Bezier shape to be moved with its guiding centre along a guiding trajectory that is a non-rational Bezier path included in said object set, said method comprising the steps of: a. for each trajectory Bezier curve providing a trajectory set of trajectory control points in an associated coordinate-wise oriented trajectory curve bounding box and for each brush Bezier curve providing a brush set of brush control points in an associated brush curve bounding box, and providing a brush bounding box containing all points of the brush shape; b. for each pixel determining application coordinate values regarding any relevant object element for an actual point corresponding to that pixel, and then dilating each respective trajectory curve bounding box with the brush bounding box to a dilated box and c. in a determination procedure determining for said actual point either; c1. actual point outside dilated box then reject trajectory curve in question and go to another trajectory curve, or c2. actual point inside brush bounding box when brush guiding centre positioned in either end point of actual trajectory curve, then execute brush procedure with respect to such end point, but c3. otherwise execute a division procedure on the trajectory Bezier curve in question and take any part as secondary trajectory Bezier curve, for processing in said determination procedure; d. in the brush procedure for any brush Bezier curve determining for said actual point either: d1. actual point outside brush Bezier curve bounding box then go to intersection procedure, or d2. actual point coincides with any brush Bezier curve end point then exit to assignment procedure, or d3. all control points of brush Bezier curve lie in a 2x2 discrete point square then go to intersection procedure, but d4. otherwise execute division procedure on brush Bezier curve in question and take any part as secondary brush Bezier curve for processing in said brush procedure; e. in said intersection procedure determine a number of intersections of a particular semi-infinite line starting in said actual point with an actual brush Bezier curve and accumulating said number, until all brush Bezier curves have been processed in the brush procedure and then in case of an odd accumulation result going to said assignment operation but otherwise return to said determination procedure while resetting the accumulation; f. in said assignment procedure assigning an -inside- indication to the pixel in question and exit; g. but otherwise assigning an -outside- indication to the pixel in question, and exit.
Claim 2
Dependent Claim 432 words
A computer method for pixel-wise generating a display picture representing an object set of object elements, including a brush object element that is a Bezier shape to be moved with its guiding centre along a guiding trajectory that is a non-rational Bezier path included in said object set, said method comprising the steps of: a. for each trajectory Bezier curve providing a trajectory set of trajectory control points in an associated coordinate-wise oriented trajectory curve bounding box and for each brush Bezier curve providing a brush set of brush control points in an associated brush curve bounding box, and providing a brush bounding box containing all points of the brush shape; b. for each pixel determining application coordinate values regarding any relevant object element for an actual point corresponding to that pixel, and then dilating each respective trajectory curve bounding box with the brush bounding box to a dilated box and c. in a determination procedure determining for said actual point either; c1. actual point outside dilated box then reject trajectory curve in question and go to another trajectory curve, or c2. actual point inside brush bounding box when brush guiding centre positioned in either end point of actual trajectory curve, then execute brush procedure with respect to such end point, but c3. otherwise execute a division procedure on the trajectory Bezier curve in question and take any part as secondary trajectory Bezier curve, for processing in said determination procedure; d. in the brush procedure for any brush Bezier curve determining for said actual point either: d1. actual point outside brush Bezier curve bounding box then go to intersection procedure, or d2. actual point coincides with any brush Bezier curve end point then exit to assignment procedure, or d3. all control points of brush Bezier curve lie in a 2x2 discrete point square then go to intersection procedure, but d4. otherwise execute division procedure on brush Bezier curve in question and take any part as secondary brush Bezier curve for processing in said brush procedure; e. in said intersection procedure determine a number of intersections of a particular semi-infinite line starting in said actual point with an actual brush Bezier curve and accumulating said number, until all brush Bezier curves have been processed in the brush procedure and then in case of an odd accumulation result going to said assignment operation but otherwise return to said determination procedure while resetting the accumulation; f. in said assignment procedure assigning an -inside- indication to the pixel in question and exit; g. but otherwise assigning an -outside- indication to the pixel in question, and exit.
Claim 3
Dependent Claim 55 words
A method as claimed in Claim 1, wherein said determination procedure in conjunction with steps c1, c2 it is tested whether all control points of the actual trajectory Bezier curve lie in a 2x2 discrete point square then go to said brush procedure, with brush positioned in either end point of actual trajectory Bezier curve.
Claim 4
Dependent Claim 75 words
A method as claimed in claim 1, wherein said semi-­infinite line has a first coordinate-wise direction, and in conjunction with steps c1, c2 it is tested whether a straight line through the actual point and perpendicular to said first coordinate wise direction would cross always the brush shape when it be positioned with its guiding center on any arbitrary control point of the actual trajectory curve and in the positive case go to assignment procedure.
Claim 5
Dependent Claim 75 words
A method as claimed in Claim 1, wherein in point c2 the brush procedure is accessed when actual point is in brush bounding box when brush bounding box coincides with any corner of dilated box and in the brush procedure it is tested whether actual point is outside the brush but in a coherent area that is contiguous with a corner of the dilated box, and in the positive case go to another trajectory curve.
Claim 6
Dependent Claim 49 words
A method as claimed in Claim 1, wherein in conjunction with step c1 said outside result disqualifies the trajectory curve in question for consideration with respect to any actual point on an infinite line coinciding with said semi-infinite line, provided said infinite line does not cross the dilated box.
Claim 7
Dependent Claim 72 words
A method as claimed in Claim 5, wherein the size perpendicular to said infinite line of said dilated box is NOR-ed in at least a subset of the trajectory curves to yield a non-coincidence with respect to a set of parallel contiguous lines of points comprising said infinite line, and any trajectory curve within said subset is disqualified for consideration with respect to any actual point on any line of said set.
Claim 8
Independent Claim 45 words
A method as claimed in any of Claims 1 to 6, wherein said guiding trajectory is a closed shape and also defines said -­inside- indication, wherein said brush procedure is also executed on the trajectory in isolation, which then operates as a second, stationary, brush.
Claim 9
Dependent Claim 28 words
A method as claimed in Claim 7 wherein an -inside- indication generated with respect to said trajectory overrules any -outside- indication resulting from processing of the brush shape.
Claim 10
Independent Claim 25 words
A method as claimed in any of Claims 1 through 8, wherein any -inside- indication produced for an actual pixel terminates processing of that pixel.
Claim 11
Independent Claim 37 words
A method as claimed in any of Claims 1 to 9, wherein said brush shape has a dimension that is variable in application coordinates for keeping its dimension fixed in display device coordinates under any zooming/dezooming operation.
Claim 12
Independent Claim 19 words
A method as claimed in any of Claims 1 to 10, wherein said guiding trajectory defines an alfanumerical character.
Claim 13
Independent Claim 19 words
A method as claimed in any of Claims 1 to 11, wherein said guiding trajectory interconnects two closed figures.
Claim 14
Independent Claim 84 words
A method as claimed in any of Claims 1 to 12, for determining spatial coherence within a display window with respect to a region that is outlined by a second closed Bezier path, to be displayed, wherein said second path operates as said guiding trajectory and said window is spatially inverted with respect to an origin point, said origin thereupon operating as guiding centre, and a result of said inverting operating as brush, after which any -inside- indication for said origin point signals non-coherence.
Claim 15
Independent Claim 18 words
A method as claimed in any of Claims 1 through 13, for use on a multicolor display apparatus.
Claim 16
Independent Claim 18 words
A method as claimed in any of Claims 1 through 14, for use on a text processor device.
Claim 17
Independent Claim 18 words
A method as claimed in any of Claims 1 through 15, for use on a graphics processing system.
Claim 18
Independent Claim 97 words
A method as claimed in any of Claims 1 through 16, wherein said brush shape contains a rational Bezier curve that by means of conical projection with respect to a second origin is transferred into a non-rational Bezier curve in three dimensions, which by means of cylindrical projection parallel to the junction line between the second origin and the actual point transfers to a further non-rational Bezier shape for which the point containment result of the second origin is identical to the point containment of the original point in question with respect to the original brush shape.
Claim 19
Dependent Claim 17 words
A method as claimed in Claim 17, wherein the brush shape contains at least one conic section.
Claim 20
Dependent Claim 17 words
A method as claimed in Claim 18, wherein said brush shape consists exclusively of conic section parts.
Claim 21
Dependent Claim 16 words
A method as claimed in Claim 19, wherein such brush shape is a single conic section.
Claim 22
Dependent Claim 14 words
A method as claimed in Claim 20, wherein said brush shape is a circle.
Claim 23
Dependent Claim 14 words
A method as claimed in Claim 20, wherein said brush shape is an ellipse.
Claim 24
Independent Claim 18 words
A method as claimed in any of Claims 1 through 16, wherein said brush shape is a rectangle.
Claim 25
Independent Claim 214 words
An apparatus for practising the method as claimed in any of Claims 1 through 23, said apparatus comprising: - first storage means for selectably storing a sequence of trajectory control point coordinates and edge coordinates of brush bounding box (250); - second storage means for storing coordinates of said actual point (154) - first calculating means fed by said first and second storage means for calculating relative coordinates of said trajectory control points; - first test means fed by said first calculating means for testing on all control points of a Bezier curve to lie in a 2 point x 2 point square (260); - second calculating means fed by said first storage means and second storage means for calculating relative values of edges of the dilated box (266,); - second test means fed by said second calculating means for testing whether the actual point is outside said dilated box (272, 274); - third calculating means fed by said first calculating means for calculating control points of a divided trajectory Bezier curve and feeding these to said first and second test means for conditional retrocoupling to its own input; - said apparatus furthermore having an output means fed by said first calculating means for outputting processed control points to a brush routine processing means.
Claim 26
Dependent Claim 35 words
An apparatus as claimed in Claim 24, wherein said third calculating means is an array means for coincidentally calculating at least two output control points as intermediate point between respective pairs of input control points.
Claim 27
Dependent Claim 29 words
An apparatus as claimed in Claim 24, wherein said array means has a single file of adders that has a serial pipeline organization and a plurality of parallel outputs.
Claim 28
Dependent Claim 29 words
An apparatus as claimed in Claim 24, wherein said brush routine processing means has at least a trajectory Bezier curve dividing means in common with said third calculating means.
Claim 29
Dependent Claim 43 words
An apparatus as claimed in Claim 24, wherein a third storage means is provided to an output of said third calculating means for stackwise storing control points of at least one divided trajectory Bezier curve, for later processing in said third calculating means.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag