Application of Freeman

Decision Date30 March 1978
Docket NumberAppeal No. 75-531.
Citation573 F.2d 1237
PartiesApplication of Richard Don FREEMAN.
CourtU.S. Court of Customs and Patent Appeals (CCPA)

Robert O. Nimtz, Murray Hill, attorney of record, for appellant.

Joseph F. Nakamura, Washington, D. C., for the Commissioner of Patents, Jere W. Sears, Washington, D. C., of counsel.

Before MARKEY, Chief Judge, and RICH, BALDWIN, LANE and MILLER, Judges.

MARKEY, Chief Judge.

Appeal from the decision of the Patent and Trademark Office (PTO) Board of Appeals (board), affirming the rejection of claims 1-10, all of the claims in application serial No. 32,025, filed May 6, 1970, and entitled "Computer Typesetting." We reverse.

The Invention

The subject matter of Freeman's invention is a system for typesetting alphanumeric information, using a computer-based control system in conjunction with a photo-typesetter of conventional design. Freeman's overall scheme is represented by Figure 1 of his application.

Input device 140 provides the identities of symbols and alphanumeric characters to be composed and the positional commands for placement of such symbols and characters in the final composition. Although shown in Figure 1 as a keyboard, input device 140 may be a card reader, a magnetic or paper tape reader, or other known input device. Memory 160 stores character specifications and provides computer 100 with detailed information about the exact nature of the characters which may be selected by coded input signals from input device 140. Memory 160 may be part of computer memory 130. Computer 100 represents a broad category of data processors, including general purpose digital computers.

Output unit 170 receives character position signals from computer 100 and generates a permanent record of the desired positional relationship of the characters. As shown in Figure 1, output unit 170 may include a display device, such as cathode ray tube (CRT) 175, and a photographic system, such as camera 176. Output unit 170 may also be a computer microfilm printer, or other means of producing a permanent record.

Freeman's system is especially useful in printing mathematical formulae. Its particular advantage over prior computer-aided printing systems is its positioning of mathematical symbols in an expression in accordance with their appearance, while maintaining the mathematical integrity of the expression.

The functioning of appellant's invention is best understood in appellant's example, wherein the objective is the photocomposing of the mathematical expression:

One embodiment of appellant's invention employs a hierarchical "tree structure" computer storage arrangement. Applied to the above mathematical expression, the hierarchical arrangement produces this tree structure:

Each particular tree structure depends on spatial relationships of the symbols, not on their mathematical meaning, i. e., all symbols, whether characters or operators, are treated in the same way. As in Figure 3 above, the "head" of the tree structure is the symbol at the extreme left of the main line of the formula. New "branches" of the tree are started by those symbols which begin new lines, above, on, or below the main line of the formula, e. g., exponents and initial symbols of numerators and denominators.

The tree structure storage arrangement is used to determine the sequence, indicated by the circled numbers in Figure 3, in which the symbols of the formula are processed by the "local positioning algorithm" disclosed by appellant. Symbols attached by arrows leading out from a given symbol are called "subordinates" of the given symbol. In Figure 3, for example, the "1," the "7," and the "h" are subordinates of the integral sign.

Another basic feature of appellant's invention is the use of a set of "concatenation points" for each character. Prior art devices, like the typical Linotype machine, employed a rectangular, edge-to-edge concatenation system. Appellant's sets of concatenation points correspond roughly to the eight major compass directions, as shown in this figure:

To form the expression "2†" from the above characters, the West concatenation point of the"†" is specified to coincide with the East concatenation point of the "2". A particular advantage of appellant's concatenation point positioning technique is its applicability to both straight linear text and to subscripts, superscripts, division signs, and integral signs. To form the expression "†2," the Southwest concatenation point of the "small 2" is specified to coincide with the Northeast concatenation point of the "†."

Appellant's local positioning algorithm, using concatenation points to typeset mathematical expressions stored in a hierarchical tree structure, is disclosed in its simplest form:

(1) Cause an appropriate (specified) concatenation point for subordinates of a given symbol to coincide with appropriate (specified) concatenation points for that given symbol. * * *.
(2) The order of symbol processing is as follows:
(a) Along a given branch of the tree, positioning starts at the righthand end and works back to the left. It should be understood that right and left refer to the structure as shown in FIG. 3 (head at the left). It may be convenient to represent and/or store the structure in a vertical arrangement with the "head" at the top or bottom. In all cases, however, the order of positioning will proceed in a given branch in a direction toward the head of the structure.
(b) If a given symbol along a given branch has subordinate symbols that start new branches, all of these new branches are positioned internally (with respect to the given symbol) before any positioning is performed on the given symbol of the given branch. For example, in FIG. 3, the symbols in the branch started by the left parenthesis "(" that is a subordinate of the horizontal division sign are positioned relative to each other before the local positioning algorithm is applied to any of the symbols on the main (division sign) branch.

In sum, appellant's invention includes three signal-processing steps. First, the input codes are read, and a tree structure of symbols representing the mathematical expression is built. Second, the signals specifying the relative concatenation point positions of the symbols are composed by application of the local positioning algorithm. Third, an image of the expression, with all symbols in proper position, is generated on the CRT or other output device.

The Claims

Claims 1-7 are apparatus claims:

1. In a computer display system comprising (A) a display device for generating relatively-positioned symbol images in response to applied sequences of signals specifying the shape and position of said images,
(B) a data processor comprising
(1) means for storing a first plurality of data sequences, each describing individual symbols, and a second plurality of data sequences corresponding to a control program,
(2) means responsive to said control program for nondestructively reading from said means for storing and transferring to said display device selected ones of said first plurality of data sequences,
(3) means responsive to said control program for generating and transferring to said display device data sequences specifying the desired position of at least a first one of said selected data sequences, the improvement comprising
means for storing additional information specifying spatial coordinate positions, relative to a reference point on a corresponding symbol, of a plurality of concatenation points associated with said corresponding symbol, and
means responsive to said control program for generating and transferring to said display device data signals specifying the coincidence of at least one specified concatenation points sic on adjacent symbols.
2. The system of claim 1 further comprising input means for modifying said control program by providing input data specifying the desired positioning of said images.
3. The system of claim 2 further comprising means for storing said input data in a hierarchical tree structure, the lowest level branch of said structure corresponding to the position of the symbol described by said first one of said selected data sequences, successively higher branches of said structure indicating the position of corresponding symbols relative to the position of the symbol described by said first one of said selected data sequences.
4. The system of claim 3 further comprising editing means responsive to the images generated by said display device and to said control program for modifying the relative position of selected ones of said images.
5. The system of claim 3 sic, 4? wherein said editing means comprises a light sensitive device for generating signals indicating desired image positions and program controlled means for modifying said data signals specifying the coincidence of concatenation points.
6. A display system comprising
(A) a display device responsive to applied information signals for generating images,
(B) means for storing display information corresponding to a plurality of display entities, said display information comprising entity identification information and information identifying the position of a plurality of concatenation points corresponding to each of said display entities,
(C) programmed controlled means for generating position signals specifying the relative position of selected ones of said display entities by specifying the coincidence of at least one of the concatenation points associated with one of said selected ones of said display entities with appropriate concatenation points associated with adjacent ones of said selected display entities, and
(D) means for applying entity-identification signals and associated position signals to said display device.
7. The system of claim 6 further comprising means responsive to said entity identification signals and said position signals corresponding to said adjacent ones of said selected display entities for testing for
...

To continue reading

Request your trial
81 cases
  • Arrhythmia Research Technology, Inc. v. Corazonix Corp.
    • United States
    • U.S. Court of Appeals — Federal Circuit
    • March 12, 1992
    ...to enforce a legal standard embodied in broad, vague, nonstatutory terms, the courts have floundered. At length, in In re Freeman, 573 F.2d 1237, 197 USPQ 464 (CCPA 1978) as modified by In re Walter, 618 F.2d 758, 205 USPQ 397 (CCPA 1980), the Court of Customs and Patent Appeals settled on ......
  • Alappat, In re, 92-1381
    • United States
    • U.S. Court of Appeals — Federal Circuit
    • July 29, 1994
    ...1395, 1399, 163 USPQ 611, 616 (CCPA 1969); In re Chatfield, 545 F.2d 152, 156, 191 USPQ 730, 733 (CCPA 1976); In re Freeman, 573 F.2d 1237, 1245, 197 USPQ 464, 471 (CCPA 1978). As a corollary, the court reasoned that if the claim does recite structure, the claim necessarily does not "wholly......
  • In re Bilski
    • United States
    • U.S. Court of Appeals — Federal Circuit
    • October 30, 2008
    ...address the issue of whether several other purported articulations of § 101 tests are valid and useful. The first of these is known as the Freeman-Walter-Abele test after the three decisions of our predecessor court that formulated and then refined the test: In re Freeman, 573 F.2d 1237 (CC......
  • CLS Bank Int'l v. Alice Corp.
    • United States
    • U.S. Court of Appeals — Federal Circuit
    • May 10, 2013
    ...63, 93 S.Ct. 253, 34 L.Ed.2d 273 (1972), In re Abele, 684 F.2d 902 (CCPA 1982), In re Walter, 618 F.2d 758 (CCPA 1980), and In re Freeman, 573 F.2d 1237 (CCPA 1978), vindicated the proposition that “all else had failed.” And for me, the magisterial statute with its sweeping inclusion of “an......
  • Request a trial to view additional results
5 firm's commentaries
  • Bioinformatics: The New Software Patent Frontier
    • United States
    • Mondaq United States
    • September 27, 2001
    ...Cir. 1999). "Other News to Note," BioWorld Today, Aug. 17, 2000, at 3. See, e.g., Diamond v. Dehr, 450 U.S. 175 (1981), In re Freeman, 573 F.2d 1237 (CCPA 1978), as modified by In re Walters, 618 F.2d 758 (CCPA 1980) and In re Abele, 684 F.2d 902 (CCPA 1982), Arrhythmia Research Tech. V. Co......
  • My Reflections On Examining And Prosecuting Patents In AI For The Last 40 Years
    • United States
    • Mondaq United States
    • October 12, 2021
    ...Gottschalk v. Benson, 409 U.S. 63 (1972) 2 Parker v. Flook, 437 U.S. 176 (1978) 3 Diamond v. Diehr, 450 U.S. 175 (1981) 4 In re Freeman, 573 F.2d 1237 (C.C.P.A. 1978); In re Walter, 618 F.2d 758 (C.C.P.A. 1980); In re Abele, 684 F.2d 902 (C.C.P.A. 5 "Examination Guidelines for Computer-Rela......
  • My Reflections On Examining And Prosecuting Patents In AI For The Last 40 Years
    • United States
    • Mondaq United States
    • October 12, 2021
    ...Gottschalk v. Benson, 409 U.S. 63 (1972) 2 Parker v. Flook, 437 U.S. 176 (1978) 3 Diamond v. Diehr, 450 U.S. 175 (1981) 4 In re Freeman, 573 F.2d 1237 (C.C.P.A. 1978); In re Walter, 618 F.2d 758 (C.C.P.A. 1980); In re Abele, 684 F.2d 902 (C.C.P.A. 5 "Examination Guidelines for Computer-Rela......
  • Data Transmission And Storage Invention Held Not Patent Eligible; Telephone Not Specialized Machine
    • United States
    • Mondaq United States
    • April 11, 2014
    ...(Fed. Cir. 2010). In re Alappat, 33 F.3d 1526, 31 USPQ2d 1545 (Fed. Cir. 1994) (en banc). Id., 31 USPQ2d at 1558 (citing In re Freeman, 573 F.2d 1237, 1247 n.11, 197 USPQ 464, 472 n.11 (C.C.P.A. 1978); In re Noll, 545 F.2d 141, 148, 191 USPQ 721, 726 (C.C.P.A. 1976); In re Prater, 415 F.2d ......
  • Request a trial to view additional results
5 books & journal articles

VLEX uses login cookies to provide you with a better browsing experience. If you click on 'Accept' or continue browsing this site we consider that you accept our cookie policy. ACCEPT