In re de Castelet

562 F.2d 1236, 195 U.S.P.Q. (BNA) 439, 1977 CCPA LEXIS 112
CourtCourt of Customs and Patent Appeals
DecidedOctober 6, 1977
DocketPatent Appeal No. 76-699
StatusPublished
Cited by13 cases

This text of 562 F.2d 1236 (In re de Castelet) is published on Counsel Stack Legal Research, covering Court of Customs and Patent Appeals primary law. Counsel Stack provides free access to over 12 million legal documents including statutes, case law, regulations, and constitutions.

Bluebook
In re de Castelet, 562 F.2d 1236, 195 U.S.P.Q. (BNA) 439, 1977 CCPA LEXIS 112 (ccpa 1977).

Opinion

MARKEY, Chief Judge.

Appeal from the decision of the Patent and Trademark Office Board of Appeals (board), affirming the rejection of claims 5-7, all the claims in application serial No. 68,507, filed August 31, 1970, entitled “Method of Generating a Curve, Applicable [1238]*1238to Tracing Machines or Machine Tools.” We affirm.

The Invention

De Castelet’s invention relates to a method of generating a curve or family of curves, employing a computer in conjunction with drafting and milling machines. The invention employs these principles: (1) a curve may be represented by four points defining two straight line tangents to the ends of the curve, and (2) a curve can be represented by a transformed base-of-reference curve, by transforming coordinates of points representing a unit or base curve into a coordinate system of a curve to be generated.

In de Castelet’s overall system:

data are inputed to computer 10 through control boards 19 and 20. Calculations, using the inputed data and pursuant to stored programs, are performed by computer 10. Computer 10 also receives milling machine 11 position information from encoder 13 and drafting machine 12 position information from encoder 14. Based upon the results of its calculations and information received from encoders 13 and 14, computer 10 generates speed-change signals for controlling position motor driving shafts 21-25. The net result of the operation is a machined surface (milling machine 11) or a drawing (drafting machine 12) which corresponds to a desired curve formation.

According to de Castelet’s method, curves to be generated are first broken down into a series of successive arcs. Those arcs can be defined by two straight line tangents, for example, AM and BN in the following illustrations:

The data inputed to the computer constitutes the X, Y, and Z Cartesian coordinates of points A, M, N, and B. The computer, pursuant to a stored program, treats each arc so defined as though it were the transformed curve of a base curve inscribed within and between two opposite vertices of a unit cube. The coordinates of that base curve are transformed by computer calculations, according to the following transformation equations, into coordinates of the curve to be generated:

De Castelet claims:

7. A machine method of generating a curve from data supplied to a computer in the form of coordinates of points defining two given segments of tangents to the curve to be generated extending from the end of and subtended by said curve for controlling numerical control system type model forming means, wherein data, in the form of electrical signals representing a table of coordinates of points, of characteristics of a base curve inscribed on a unit-cube between two oppo[1239]*1239site vertices of said unit-cube is stored in a memory bank of said computer and said computer is programmed (1) to treat electrical signals representing a given arc, defined by the coordinates of the ends of two segments of tangents extending from and subtended by the ends of said given arc, as the transformed curve of said base curve, wherein said ends are considered as the transformed points of vertices of said unit-cube and (2) to calculate and transmit to the control system of said model forming means electrical signals representing the coordinates of a sequence of points of successive ones of said given arc defining said curve to be generated, said computer thereafter automatically performing the steps of:

(a) transforming the electrical signals representing said coordinates of points defining two given segments of tangents to said curve to be generated by program (1) to define a corresponding change in reference coordinates with respect to the characteristics of the stored base curve;

(b) calculating the sequence of coordinates of the current points of the transformed base curve of program (1) through the change in reference coordinates obtained from step (a); and

(c) transmitting electrical signals representing said sequence of coordinates calculated in step (b) from said computer to said model forming means by program (2).

5. The method according to claim 7, wherein step (b) further comprises calculating said sequence of coordinates of the current points according to the following equations:

Xw, Yw and Zw are the coordinates of a current point of each arc of the curve to be generated;

Xa, Ya and Za are the coordinates of the point of origin of the arc of the curve to be generated; and

x, y and z are the coordinates of a current point of the base curve, and

are the respective projections on the X, Y and Z axes of the two segments of tangents to the arc of the curve to be generated and of the segment joining the ends of said two segments opposing the point of tangency.

6. The method according to claim 7, wherein step (c) comprises the further step of interpolating between adjacent points of said sequence of points obtained by program (2) according to a calculation of the director cosines of the tangents of each one of said sequence of points.

The Board

The board, citing Gottschalk v. Benson, 409 U.S. 63, 93 S.Ct. 253, 34 L.Ed.2d 273, 175 USPQ 673 (1972), stated that “where the claimed novelty involves a formula, equation or algorithmic process and has no substantial practical application except in connection with a digital computer, a patent to such would in practical effect be a patent on the algorithm itself, and should not be granted.”

Acknowledging that independent claim 7 does not recite a specific algorithm, equation, or mathematical formula, the board nevertheless found an algorithmic process contained therein, and concluded that, because the apparatus was known, any novelty in the claims resulted from that algorithmic process. That novelty, the board said: “is of the same nature as that which is condemned in Benson.”

The board was of the opinion that patenting the present claims would, in effect, preempt the algorithmic process despite the fact that “they recite a machine environment, a particular art or a particular end use.”

[1240]*1240 The Issue

As in In re Chatfield, 545 F.2d 152, 191 USPQ 730 (Cust. & Pat.App.1976), cert. denied, 46 U.S.L.W. 3203 (Oct. 4, 1977), the sole issue before us is whether the particular claims on appeal define statutory subject matter under 35 U.S.C. § 101.1

OPINION

The Board's Interpretation of Benson

Though we agree with the board’s ultimate conclusion, and with its reference to Benson as precluding patentability of claims to a mathematical equation, we disagree with several of the board’s expressions of the applicable law. Initially, the board found:

[T]he thrust of the decision in Benson to be that computer programs or program implemented algorithms are not patentable subject matter at least until such time as the Congress acts otherwise.

That “computer programs” are not patentable is

Free access — add to your briefcase to read the full text and ask questions with AI

Related

In Re Karen I. Trovato and Leendert Dorst
42 F.3d 1376 (Federal Circuit, 1994)
In re Meyer
688 F.2d 789 (Customs and Patent Appeals, 1982)
Diamond v. Diehr
450 U.S. 175 (Supreme Court, 1981)
Arshal v. United States
621 F.2d 421 (Court of Claims, 1980)
In re Maucorps
609 F.2d 481 (Customs and Patent Appeals, 1979)
In re Bradley
600 F.2d 807 (Customs and Patent Appeals, 1979)
In re Gelnovatch
595 F.2d 32 (Customs and Patent Appeals, 1979)
In re Johnson
589 F.2d 1070 (Customs and Patent Appeals, 1978)
Parker v. Flook
437 U.S. 584 (Supreme Court, 1978)
In re Freeman
573 F.2d 1237 (Customs and Patent Appeals, 1978)

Cite This Page — Counsel Stack

Bluebook (online)
562 F.2d 1236, 195 U.S.P.Q. (BNA) 439, 1977 CCPA LEXIS 112, Counsel Stack Legal Research, https://law.counselstack.com/opinion/in-re-de-castelet-ccpa-1977.