SU-326-P23

.

A BIBLIOGRAPHY ON COMPUTER GRAPHICS

BY

BARY W. POLLACK

STAN-CS-72-306

AUGUST 1972

COMPUTER SCIENCE DEPARTMENT School of Humanities and Sciences STANFORD UNIVERSITY

This research was supported in part by the Atomic Energy Commission, under Project AT(04-31-326 PA 23, and the National Science Foundation under Contract #GJ 689.

AP -- Applicatbn FrocIrams ): Systems: contains those wo L-F: .'; wh OS( r)rim;lry intent is the expositian or demonstration of a producti.on cra?p!G.cs system or production system utilizinq G computer qraphir3. AS -- .Jw3ocintive Systems: contains works describing SChQfZ6?S for i~~lement-.iny ass0ciati.w data structures. It also includes entriGs (?2scrit)inq associative accessing techniques such ds hash-codinq,

CA -- Cm~ptlter Ai.~!~~d ITesign: contains works which are pII.iii:;lXTily descripticxs 9r‘ :lro?uction desiqn systems such as circuit de;;im, 3irfqil dezian, structural design, et.<), It also includes entries r2Ia5.2iJ to data structures and sped.fic tcXzkrli.ques m+2ful in iaylenenfina computer aided desiqn systms. cs -- Control StrwWlr~s: contains those Works relatinq t-0 the-? dt2siqn ar,i-: us;! of vx%3us control structures.

97; -- r)dftFl Str~IC+UfG?!~: contains those works re2nted to f 1: C? :I wigrl ar, ? irrp1emont.i3tior~ cf various Jata structures C?SP~C i;ll ly suited for comfort-er graphics, comparisons of such data . strut tures, ~storaw l~l'lwx+ion and other relat.ed techniques.

EL, -- Extt?nn.ihl+z Lanquayps: con%ains a brief listing of the more relevant works in +,hir field. es -- !lardware, Nrdvare Techniques an?! Systems: wont h ins +hr>sc? works related. tc hardware rather than software !~vStems. It includes terminals, terminal systems, hardware desiqr., bar;tware input/output devices, hardware techniques for JC.-+creOscopic visit 32-d spccinl purpose hardware for qraphics. IA -- Zmay~? AnCtlvsi.s, Pattern Recoynition, Picture i: r 9ct's.sj i n(r : inclw3x works in these and all. related fields (1 -“ iI 1 i. 1' ' 1 r;r i 3x3 L i?. y with Cctllrc? recoqnition rather than picture ('1 c II et a t 1 cn . c

c LS -- Lanarla~es & Svstems: contain:; those works which 2re f!ri";lari!y expositions of ccmputer lanquaaes or systems ~cywcinl ly desiqnod for graphics. F*'J -w rhiloAqP‘y: cort;;lins those works expressing c,j3i!, i. <)II.~ on clrn~kiics in wwral, descriptions of experiences wit-h qr.2 qi:ics, descriptions of the requirements for qraphics systems, c't c:. FP -- Faral.lcl Processinq: contains a brief listing of "its pore rc?levm+, works in this field. PS -- rroblm Solving: contains those works in this !:ir:id M art.ificial intelligence which may he applied to qra p1: im. tM -- cuestion Answering Systems: contains those works i t t i, i 5; field af ;irtifil:ial inteJ.liqence which may he applied +o or-n pti its. SA -- Semar!ti.cs & Artificial Intelligence in General: cxmtains a variety of works dealina with the semantics of 1 cl r-! q II a a P , t. h e s?mar.tics or' data structures, implementinq 3t=ma:.tics, intelliljqnt systems for picture recoqnition hnil (! ;A L-c.71 L'-Pim, tl-xx3 proving, tlsinq artificial intelligence t c L:.I 1: i q u -3:; TV interact with systems usinq English, etc.

sx -- Sim!datiorc contains a brief listing of the more y.;-*,* Jvnnt recent wor?s in this fiel?.

TS -- Wdmiques: contains specific techniques for qttxkina som;! Forticn of +-he problem of how one implements a CO;!i[)U +13r qraphics 3ysten. It includes hidden line and surface f t' :!I ov al , data structure access techniques, mathematical + v~C i.i: i,iueI-; for modeling arbitrary surfaces, etc.

‘13 -- :. _ ?heoren Wdvinq: contains those works in Fhis iaclli \), jr'_ifici31 int elliuenco which may ix applied to . i ti > -.:;. 1<:s. The researcher interested in further explor:l.nq the field is referred t.0 the followinq major sources: Commrlnications Association for Computinq rachinery ,lournal A sso<ion for Computinq Plachinery Computing ?wA.ws (ACM) IPY ?, J. JJats9n Research Center Reports -rot. AFTPS Sprinu and,Fall Joirlt Computer Conferencfls ?I-OC. ‘institute of ELectrical anI ELectronics Xngi.neers Proc. f,nnual S!IAVYACM-TREE Design Automation, Workshops Transaction.3 W?ctronic Computers Grout, TEE? Computer Gra;,hicq publication of XXGi-(APH, ACM STGDLAN Notices, publication of SXGPLAN, ACM Computer Architecture News, publicat ion of SICAKH, ACM Yoctoral 3isssrtnt5ons: Carnaqie-Mellon University, Universitv of Utah, Stanford IJniversity, IJnivzr5itv of f.Llinois, Ma::sachusetts Institute cf Technoloqy, t?t.c.

i

c

c c

c

Friessn, D. P. A professional animator 3.ooks at COmpUter ani.ma+ion. UATDE, (1969). U AN

Grater, F., and Rlasyn, M. W. KARMA: a system for storyboard animation. IRM T. J. Watson Research Center, RC 3052, (Sep 7970). U AN

Honey, F. 3. Computer techniques in educational films. UATDE, (1969). t AN

Honey, F. J. Tlalevision techniques in computer animation. UI\IDE, (1969). P AN

Computer Vandlino of GraDhicalI Information, 097m l 153-184. Q AN c

c

c c < An (\fr> Al?7erson, !?. Y. I\ two dimensional syn’.ax tor mathematical notatjorr. Ihrvard, f WGf,), unpuh‘3 ished report.. # AP CS L < b-i 7Oc> AtI lnst?n, 5. z. htcrdct iv@ graphics in architecture, (.*O;~~pUters and Au t(nmation 19, 8 (AMJ 1970) , 27-Y!. 0 4P

c

c 15:3S:21 W/31/72 A I3fBLIOGRAPHY ON COKPUTER GRAPHICS . PACF 2. 2 Application programs anki systems

Renninq?.on, P. J. Man-machine interaction in the design of rotating electrical machines. Proc SHARE-ACM-IEEE Design Automation Workshop, Miami Beach, Fla., (Jun 1969), 47-59. t AP

Bochm, B. W., Lamb, V. F., fiohley, R. L., and Rieber, 3. F. Interactive trajectory analysis: the graphic PQCKFT svstew. Proc SHARE-ACM-IEEE Desian Automation Workshop, Miami Reach, pla., (Jun 1969), 205-232, b AP Ctl'ao, G,, Woo, L, S., Lorenzo, J., and Freudenstein, F, Kinematic svnthesis of mechanisms usincl computer graphics. Proc SHARE -JNX-IEEE Desiqn Automation Uorkshop, (Jun 1969), Miami Reach, Fla,, 45-46. t AP TE

Chnsen, S.H. A@ications of man-computer graphics, Computer Graphics 70, Rrunel IJJlivPrsity, (Apr 1970). # AP 1’~:35:21 w/31/72 A RIULIOGFAPHY ON COMPUTER GRAPHICS PAGE 2. 3 Application proarams and systems

Dnmerell, J. D. C'Knracter font i?er,iun on a qmphic system. Information Displays 5, 2 (Mar lV6R), 46-54. R AP

Pcrtouzos, M. L. PHASFPLOT: an on-lint? qraphical display technique. TX;:FF Trans. on Z'lIctctr. Computers, K-16, i (Anr 1967), 2133-209. # AP l3extouzos, M. L., and Therrim, C. N. CIPCAL, on-line ana1vG.s of: e1ectrorG.c networks. TJch. Rep?, ESL-3-248, (Ott 1966), MIT, Cambridac, Mass., Also, Proc JEFF;: 55 (May l-967), 637-654. # AP Eralenmn, cf. zathlab: a proqrnm for on -line machine assistance, in svmbolic computations. Proc AFTPS 'lOfi5 F&X, vol. 27. # LS AT’

& YGrqol?, S. L. F’T,ANIT -- a flexible Lanquaqe desian#d tor computer-human interncti0n. Proc r\FIPS 1907 FJCC, vol. 31, APIPS Press, Montvale, N. J., .545-552. 4 LS AP

Gmrge, J. F. - The SPIRE? tlemonstration system. SLAC Cc, TM No. 33, (Nov 1967). t AP

i 15:35:21 08/M/72 A BIBLIOGRAPHY ON COEEWTER GRAPHICS . PAGF 2. 0 Application programs and systems

Hornbuckle, G. D. Computer-aided Resign on the TX-2 computer. Proc SHARVACM-IEEE Design Automation Workshop, Miami Beach, Fla., (Jun 1969). 357-370. # CA AP

Klein, S., et al. The Autolinq system. Tech. Rept. No. 43, Computer Sciences Department, University of Wisconsin, fladison, Wisconsin, (Sep 1968). # AP

Krampen, Y., and Seitz, P., (ens.) Design and Planning 2. HastingsHqnse, Publishers, Inc., Nev York, (1967). .)r LS E'H AP

  • I, cci 66> Linu, M. T. S. GGncral Electric reackve display system. Pmc ‘IFEE, !&?!a. III 17onver!., Atlanta, Ga., (19fi6). tt LS AE'

    TWrnsimhnn, P., and Roddy, V, 5, V. c A gener&ivn ma-Id for hand-printed Enslish letters and its c?mpu+er imy,lementation. Computer Xoup, Research and Development, Tata Tnstitut.@ of Fundamental Research, Colaha, Bombay, TF No. 12, (1966). % A?? c

    03 71h> Partridae. P. I,. . PKAK, a-Chrea iIimensional- pattern qenerntor. Tllinois Universitv Computer Science Department, f;Ljt)t. No. 464, (19;l). Q AP

    .Fichnrdson, F. K. Graphical specification ot computation. f)CInt. of Conput Sci~ce, IJr:iver.city of: Illinois, H:+t. No. 257, (1968). t) AP 15:35:31 OW31/72 A BIBLIOGRAPHY ON COI'IPUTER GRAPFiTCS PAGI? 2. 7 Application programs and systems

    SC‘crest, 9., ancf Nievergelt, J. Emercino concepts in computer graphics. W. A. Benjamin Inc., New York, (Ott 1968). x APLS c smith, J. FYI. Automatic data evaluation, manipulation, display, and plotting with SPEED. Presented at the Ninth Annual Tech, Symposium of the ACM, (Jun. 1970). # hP t Sutherlan!, W. R., Forqie and Morel10 c Grqhics in time-sharinq: a summary of the TX-2 experience. Proc AFIP."; 19f1'3 S\JCC, vol. 34, t DH LS AP

    H. A. The MTfLTTLANG on-line prosramming system. c EVOC AFTPs 1967 S,JCC, vol. 30, AFTPS Press. MontVale, New Jersev, 559-569. * LS ;aP

    15:35:21 0R/31/72 A DIPLIOGRAPHY ON COMPUTER GRAPHICS PAGE 3, 1 Associative systems

    c

    Codd, E. p. A relational modzl TOT large shared data hanks, C ACM 13, 6 (Jun 1970), 377-387. X DS AS

    Feldman, J, A., 3nd Rovner, P. D. An associative rxocessing system for conventional diaitd computers. 'L'N 1967-19, Lincoln Lab., MIT, Lexinyton, Zlass,, (1967). 4 AS LS y;=I . ,5:21 Oi\/31/72 A PIgT:IOGRhPHY ON OOPaPrJTER GRAPHICS PAGE 3. ? Associative systems

    ?ulfer, R. fi. Associative parallel prOCesSi.ng. Proc AFIPS 1967 SJCC, vol. 30. # AS PP .Ftlller, P, Y., and Btrin, G. Some applications for content. addressable memorie% Proc AFTPS 1963 FJCC, vol. 24, 49Fi-%I% # AS

    Ll?P, C. Y., and Paull, M. C. A content addressable distributed loaic memorv with applications to infomation rtttripval. Proc IEEE, vol. 51, 924-032, (Jun 196.3). U AS !-IS

    Lwcin, Y. E., an(j Maron, M. E. W1ationn.L data fi1.e: a tool for mechanized inferww pxvcut ion and t1at.a retriwfiil. ?V-47Q3-p'!, R!iND Corp., 5ant.a Monica, Calif., (WC 196s). # AS "F 15:35321 08/M/72 A RIPLIOGRAPHY ON COMPUTER GRAPHICS PAGE 3. Associative systems

    OcGi71> McGowan, a:., and Lieqrwr, P, Tile eyuivnlsnce of sequential and associative information structure models. W'oc of SVIRP, on Data Structures in Proqramminq Lanquaqes, Gainsville, Florida, SIGPLAN Notices, L (Feb 1971). # AS nS TP IYcKeever, R. T. Th? associative memory structure. Proc AFIPS 1965 FJCC, vol. 27, Pt. 1, 371-388. c # AS

    I liovner, F. D. 11ivestiaation into pauina a software simulated associative memory system. Dot. No, 40 10 90, Univ. of Calif,, Berkeley, Calif., (1966). U AS

    Rovner, F. n,,‘and Feldman, 3. A. The LFAP Ldnuaqe and data structure!, Prnc IFIP Congress 1968, 1, North-Uolland Pub. Co., Anrsterdam, 579-585. \ * AS nS c Switt, I). 4.. Love, H. H., Jr., and Troop, R. I?. A :;sociation-c,torinq processor study. Huqhes Aircraft Tech. Rept. No. TR-66-174, (AI)-4S8533), (Jun 1966). U AS 15:35:Ll M/31/72 A BII3LIOGRAPHY ON COfYPUTFR GRAPHICS PAGE 3, 4 Associative systems

    l it LS AS Sibley, E. H., Gordon, D. G., and Taylor, R. W. Graphical svstems communications: an associative memory apnrbach. Proc MIPS 1968 FJCC, vol. 33, Pt. 1, AFIPS Press, Nor&vale, N. J,, 545-S%. 4 AS

    Wston, P. E. Cylindc?!rs: A relational data structure. Tech. Rep+. Ko. 18, Bioloqical Comput. Lab., Univ. of Illinois, Urbana, Ill., (Feb 1970). t AS DS 15:35:31 OH/31/72 A ~I[jLroGRAPYy ON CONPIW?F GRAPHICS PAGE 4. 1 Computc?r aided desian .

    Coons, S. A. An outline of the requirements for a computer aid4 &siqn system. Proc AFIPS 1963 SJCC, vol. 23, Spart.an Rooks, k N?w York, 299-304. # PI-! CA

    tC6 67h> Coons, S. A. Surfaces for computer ai-ded desiqn of space forms. MAC-TR-41, (Jun 1967). c t TO CA TF Coons, S. A. Comp&r graphics and innovative wqineerinq design. Datamation, (196ti). # LS CA T?! c _

    L Dnuty, R. 'I., and Chi, J. W. I\ c'liscipli no for flenerating practical optimal ,c;trwturaJ d~siqns. Pr(.'>c SHAP Y-ACM-1 ESE Desiqn Automation Workshop, (Jun 19691, Niami Peach, Fla., 1550168. 4 -I'E (7 A c Fijirburn, D. T. .Sim?llation of urhn growth dS a function nf accessibility. Proc SH\R!Z- ACM-TEEE Dwiqn Automat ion Workshoy, Yiami Seach, Fla., (Jun 19691, 297-322. 4 CAST i

    c ‘15:21 P/31/72 A BIRLIOGfiAPdY ON COMPUTEP GRAPHICS ' PAGE 4. 3 Computer aided design

    way, 3.c. Compound data structure for computer aided desiqn -- a survey. Proc ACM 22nd Natl. Conf., (1967), MD1 Publications, Uayne, PJI., 3515-365, # D5 CA ~!mxbuckl~, G, q, Computer-aided desian on the TX-2 computer. Proc SHARF-ACVTEEE Dosian Automation Workshop, Mi.?mi Reach, Fla,, (Jun 1969). 357-370. * CA AP

    < J L c 4 ) Jdnsm, R. k;., and Litterman, M. D. T?? ebctronic circuit analysis proaram: techniques ar,R applications, Pr?n+ice+all Inc., &mlewood Cliffs, N. J., (1968). s CA Johcson, T. E. Arbitrarily shaped spat+ curves for C A D. #IT 1966 Summer Session Course Notes t TF TE c3

    (k i 67) GJ?ow, I. c. Computer-aided design project. [Tniversity of Edinhurah, rlemo. CAD-R-10, (1957). t CA I\ RI~LIOGRAPHY OH COMY(JTEH GRAPHICS PAGE 4. ? Computer aided design .

    KIIO, F. F., Maqpwon, W. G., Jr., and Walsh, W. J. Computer graphics in electronic design. Datamation 15, No. 3, 71-79 (Har 1969). # CA L+lwis, A, D. f!. Automated design of open web steel joints. Proc SHAR Y-ACM-IEEE Design Automation Workshop, (Jun 1%9), Miami Beach, Fla., 1810183. # CA c Lindsay, C. I>. Man-machine interaction in structural. design. Proc SHAEV-AC?+IEEB Dcsiqn Automation Workshop, (Jun 19691, Miami Reach, Fla. # CA c OuaLLine, c‘. M. GLAD - a systems approach to artwork generation. Froc SHARE- ACM-IEEE Design Automation Workshop, Mjami Reach, Pla.. (Jun 19691, 403-414. # CA c

    Ross, D. T. The AED approach to generalized computer-aided desiqn. ESL-R-30!5, Flcctronic Syst. Lab., MIT,/' Cambridge, Mass., (1967). Also in Proc ACPl 22nd Nat.1. Conf., (1967), 367-385. t CA PH

    so, H. CT. OLCA - an on-line circuit analysis system. Proc IEEE 55, 11 (Nov 1967), $954~"I961. # CA

    Strauss, T.:, PI. 3DPDP - a three-dimensional piping design proaram. -Ph.D. Dissertation, Brown University, (1969). # CA Tahory, R. Survey an.3 evaluation of AED systems at NIT. Tech. Rept. TR-00.1383, IBM Systems Devlopaent Div., Poughkeepsic Lab., Poughkeepsie, New York, (Feb 1966). # LS CA 15:3s:21 OU/31/7? A RIE3LIOGRRPHY ON COEIPIJTEE GHAPHICS PAGF 4, 5 Computer aided design .

    e

    c

    c

    L

    15:35:21 or3/31/72 A HIISLIOGRAPHY ON CO!"lPUTER GRAPHICS FAGt: 5 . 1 Control structures

    t Anderson, R. 9, A two dimensional syntax for mathematical notation. Harvard, (19661, unpublished report. Y AP CS

    L Palzer, R. !!. ZXDAMIS - l2xt.endabl.e debuggina and monitoring systw. Proc AFIPS 1969 WCC, vol. 34, 567058Q. tt EL LS CS

    Dahl, D., and Nyaard, h. - .w ALGOL-based simulation language c C ACM 9, 9 (Scp 1966), 671-678. # LS SI CC Dennis, J. B, Proqramminq cwnerality, parallelism, and computer architecture. L Proc IFIP Congress 1968, c 1 - c 7. # FH PP L:; CS Dennis, J. 9. Computation structures, notes for subject 6.232. MTT, Departmertt of Flectrical Fnqineerina, (19701. e u DS cs LIj

    Dennis, J. 5., and Van Horn, E. C. Programminu semantics for multiproqratnmed computations. c ACM 9, 3 (Mar 1%6), 143-155. t) sn TF cs Dijkstra, E. w'. Solution +3f a problem in concurrent proqrammina control. C ACM 8, Q (Sep 1965), 569. X PI, TF !I? CS i ?',3rher, D. J., r;riswald, R. F., and Polonsky, I. P. SWNOL, a string manipulation lanfluag'cl'. i? ACM 11, 1 (Jan 1964), 21-30. +'I LS CS c A EXBLIOGRAPHY ON COHP(JTER GRAPHICS PAGE 5. 2 Control structures

    Fikes, R. A heuristic program for solving problems stated as nondeterministic procedures. Doctoral Dissertation, Computer Science Department, Cxneqie-Mellon University, Pittsburgh, Pa, (Nov 1968). t PS TE cs Fisher, D. A. Cmtrol structures for programming languages. Ph.D. Dissertation, Carneqie-Mellon University, Pittsburgh, Pennsylvania, (May 1970). t cs Floyd, R. W, Nondeterministic algorithms. J ACM 14, 4 (Ott 1966). 636-644, fl TF CS

    G i- 11. l s l Parallel prouramminq. COIF.~ J 1 (Apr 19S8), 2-W. it PP cs

    Jorranll, P. Some aspects of rwxt, the- base lanuuaae f-or an extensible 13nymq2 tncility. SIGPLAN Notices II, 8 (Au9 1969), 14-17. # EL 1;s cs

    Knuth, D. E,, and McNdw, J. L. A formal dpfinition of SOL. IFEF T&an% on 'rllectr. Computers, (Au9 1964), 409-414. # ts cs

    Lcavenwort h, f3. M. cc The definition of control structures in McG 360. ID?! Research Pept. RC 2376, (Feh 1969). Y cs

    Opler, A. Procedure oriented lnnguaae statements to facilitate parallel processing. C ACM 8, 5 (May 1365). XM-307. Y F’P cs

    Parnas, D. L. Sequential equivalents of' parallel processes. Carnegie Institute of Technology, (Feb 1967). L # Pi? cs Reilly, E, D., Jr., and Federiqhi, F. D. (In reversible subroutines and computers that run backwards, C ACM 8, 9 (sep 1965), 557-558, 578. % SA T3 CS c

    c Hulifson, J. F. Prclilrinarv specification of the (IA4 language. Artiticial'TnCelliqence Group, Stanford Research II\stitl0x, Tech. Note SO, (Apr 1970). # LS CS

    Smith, D. C. HLISP. Computer Science Dept., Stanford University, Rept. CS 179, Also as Artificial Intelligence Lab. Rept. SATLON 135, (Ott 19701 . # LS CS

    Steel, T. B., (e?.) Formal lanauaqe description lampayes, for computer proqrawmina. North-Holland Puhlishinu Co., Amsterdam, U966). t LS DS cs

    Weqnor, P. Programming languages, information structures and machine organization. McGraw-Hill, New York, (1968). -It 3s cs LS

    'ulinoqrad, T. Procedure3 as a representation for Aata in a computer proqrnm for understanding natural language. Project MAC, Massachusetts Institute of Technolcxyy, c -Tpch. Rept. MAC:TR-84, (Feh 1971). Y Las SA CS DS DS

    c

    c

    c

    15:35:21 08/31/72 A f!ISLIOGRAPHY ON COHPUTFli GRAPHICS PAGE 6. 1 Data structures

    G

    Ash, W, L., and Sibley, E. H. TQAMP - an interpretative associative processor with 2eductive capabilities. Proc ACM 23rd Nntl. Corif., (1968), Brandon Systxms Press, lc Princeton, New Jsrsq, 143-156. * AS SA DS J'S !3askin, Ii. B., and Morse-, S. P. Interactive sraphics in data processing: a multi-level qraphic i modellina structure for interactive design. ISM Syst. 17 7, 3 G 4 (1968), 218-228. Q LS CA DS Bayer, F., and Witzaall, C. A data structure calculus for matrices. r)ept. No. 2& Information Sciences Laboratory, c &wina scientific Besearch Laboratories, Seattle, Washington, (May 1968). * DS TE

    taw 70> Bzkic, H., an4 iJalk, R. Formalhat ion of storage properties. L Symposium on t.hjF? Semantics of Algorithmic Languages, Sprinqsr Lecture Notes Sw4.es. ft DS TF

    e I !

    15:35:21 OfI/31/72 A RIHLIOGRAPHY ON C014PUTEH GRAPHICS ' P.AGF 6. 2 Data structures

    < RC> 71c> Wtztiss, A. T. Data structures; theory and practice Academic Moss, (1971). Q DS

    YWxow, D. G., an:1 Murphy, D. 1. Stxucture ot a LISP svstem usinq two-level storaqe. C ACM 10, 3 (Mar 1967j, lSS-159. # DS LS T?

    Brt>wer, S. Data b;tse or (1ata WZC". Proc ACM 23rd Natl. Cont., (lU68), Brandor; S;ystcms Pvv~s, Prlncxton , NW ,Jc!rsey 6X-630. f# DS Chapin, N. A deeper look at data. Proc ACM 23rd Ndt.1. Conf'., (1968), Brandon Systems Press, Princeton, New *Jersey, 631-638. jt DS PH

    Wxription of a set-theoretic data structure. PLL'OC fiFIPS lc)6H FJCC, vol. 3.3, Pt.. 1, AFIPS Press, !Y'?T-i+.V de, NW &Jersey, 557-564. # DS TF

    Wh 68c> Childs, D. Il. ?+nsit)il it. y of a set-theor&.ic data structure. Proc IFIP ConcIrcss 1968, 1, North-Holland Pub. Co., Amsterdam, 420-430. t DS TF

    ((‘1: ?Ob>-C+ilds, D. L. D~vdopment of a set-+hwxetic data structure. ‘vch. nept., Se+ -'Thcoreti.c Info. Systems, (Dee 1971)). # ns

    Co:ld, ?, F. A relational no+zl tar large share?d data banks. c ACM 13, 6 (,lun 1970), 377-387. - # DS AS 15: 3c;:?l 00/H/72 A RIRLIOGRAPHY ON COMPUTFF GLiAPHTCS PAGE Data structures

    L*~~fff‘mwt, iL G., and FVC, J. Fi2c2 structurw using hashiny functions. C ACM 13, 7 (,7ul 1970), 427-432. # PS TF A:<

    Cotton, I., and Greatorex, F. S., Jr. Data structures and tcl?chniques for remote computer graphics, Proc AFTPS 1968 FJCC, vol. 33, Pt. 1, AFTPS Press1 Montvale, New Jersqf, 533054Y. 4 PS TE

    Crick, ?l. F. C., and Symonds, A. J. A soft.warc associative memory tar complex data structures. IFI Cambridge Scientific Center Tech. Rep?. G 320-206jn, (Alla 1970). P PS AS

    Dennis, J. El. Computation structures, notes for subject 6.232. MIT, Qcrpartment of Elwtrical Engineering, (1970). L fl PS us LS

    I Ellis, T. o., Heafr?sr, J. F., and Sibley, W. Lo Tl-!e Grail rinq structure and primitives. CFSII, AD 706 715. * ES

    FIvans, IL, and Van Dam, A. r Data structure proqrammina system. proc TFTP ContTre,c,z: 1968, 2. x LS DS ? ‘, :?S:?l OQ/31/72 A l-?IPLTOGHAPHY ON L"O!'!PrJTEP GRAPHICS PAGF 6, 4 I Data structures

    I FhfanS, D. s., nn? Katzcnekon, J. Cata F;tructure and man machine communication tor network prOblWUS, Proc JEEE 55, 7 (5111 1967), 1135-1744. 3. DS Fi+m?ral~l, F. L. Tntroduction to computer araphics. %r-oc- ISEE, 9~. ITI Conv., Atlanta, Ga., (1966). t ts 3s (CT- 67a> Gray, J. c, Compound :Iata structure ror coqwter aided desim -- a survev. Froc KM 22rd Nat.1. Conf,, (1967), MDT Publications, Uavrw, ??1., -355-365. d DS, CA

    < iin 7 10 Vmderson, P. Q.-r ivcd scmar.tics for some? yroaramminq lanauaqe construCts;, Newcastle upon Tyne UPivorsity, Computing Lab., NO. 19, (W71). X DS Jx:;.;en I P. A. A oraph dscomposition tpchnigue for stxucturina data. AD-658-756, Cleaxina YOUSC, Spinyfield, Va, 221.51, (Sep 1967) . # r/s

    4 LT9 7 1 > hhnstorl, J. ?. The! Contour md+zl of h10ck structure processes. Frt’,c of Svmp, on Data Structures in Proqrammino Lanfluages, SIWLAN Notices 6, 2 (Peb 1971). rt TF DS Sf LS '1IE 15:35:21 M/31/72 A AIPLIOGRAPHY ON COMLP!JTER GRAPHICS PACE 6. 5 Data structures

    c KoIlth, D. E. Inf ormntiorl st-zucturw. C%apt~~r 2 in The, Art of Computer Programming, Fundamwtal Alaorit.hms, (196!t).

    Lindsay, 3. K., Pratt, T. W., and Shavor, K. M. An experimwtal syntax directed data structure languagc3. RAND Corp., Paper P-3112, Santa Monica, (Apr 1965). tt DS LS c

    McGowan, C., ant1 Wegner, P. The e.luiv3lence of se?wntial and associative information stxlxture models, Eroc of Symp. on Datai Structures in Programming Lx-yunqes, cainsville, Florida, STGFLAN Notices, (Frb 1971). t AS DS T” c Mealy, G. Ii. !b(?thsr look at d?tn. Proc AFTP? 1967 FJCC, vol. 31, AFTFS Press, Montvale, N. J., 525-534. 11 ns 1 5:x:21 i>WS1/72 A HIRLZOGRAPHY ON COllE'UTER GRAPHICS PACE 6. 6 Pata structures

    %xris, R. Scnttor storage techniques. C ACM 11, 1 /Jan 1968), 38-44. d PS TE AS

    CR0 CSa> Potwrts, T.. G. Graphical communication and control lanquages. In 2nd Conqress on the Information Sciences, Spartan Ejcmks, New York, (196% 0 LS TE Dc

    Eovner, R. D,, and Ic'eldmn, 3. A. The LEAP lanuaye and data structure. Proc IFIP Congress 1968, 1, North-Holland pub. co., Amsterdam, 57o-V35. t AS 35

    Standish, T, A. F, data ?efigition tacility for ptoqrneminu lawuw~s. Doctoral Dissxtation, Carwui ~f4~11 on University, ?ittshurah, Pennsylvania, (Hay 1967) l

    @ l-is LS -

    d ;;* f,;;i;> 5tw1, y, ti., (eti.) Formal lanauaac dzxript ion languages for computer p:-our al:liti incr.

    SPherlan?, W. 3. Tntroduction to data structures. PITT Lincolrl Lab, (Auq 1968). P DS

    L S~ltherlan?, W. R. The COl?Al larquaw and data :;tructureS. MI?' Lincck Laboratorv, TR-405, Lexington, r;ass., (Jan 1966). SC PS TE LS

    L

    Van Dam, 4. Tntrol1uctinn to picture modeling. c Computer handling ot GrapUcal Information, (1970) I, lrll-120. (t DS PH

    <\‘a 7 2> ?=tuchpr, J. Simulatiwi .ldtd s+ruc+ur~s ur;i. ng S I M 1J L A 6 7 . fiDntrca1 '1niversit.y Tnformntion Department, Puhl, 81, (1972). 1) PS SI .Z~((:ner, P. ?roor,3mmiw liinquajes, intormation structures and BaChine cxaanization. !WGraw-Hill, Now York, (1968). # ns t-s LS

    (Yi 05) wilkw, M. V. Slaw memories and dynamic storage allocation. ITEF Trans. on 31Cjctr. Computers, EC-14N No. 2, (Auu 1%4), 270-271. u 3s 15:35:;?1 w/.3 l/7? A !-4If13LlUGiirlFIIY ON CTOMYUTEH G8APliICS PAGE 6. 9 Oata st.tuctures

    c

    t Wi f;O> Williams, F. A survey tnd an annot., txtl td.blioqraphy of da t-a sttuctur@s tar computer utnphics. T?-40 3-6, Dept. of Elwt rical Enginwrinq, New York cc Wiversity, (Se? 190). f LS DS

    tWi 71a> Williams, F. A survey of data structures for comprder Graphics Syst.eRs. c Computing Surveys 3, 1 (P!ar 1971). u DS tWi 7%) k'inograd, T. Drw:f>d ure.5 as a rqresentati on for data in a ~ompiltor proaram for w&xstand incj natural hnauaqe. L Project M!K, fiassachusetts Institute of Twhnoloqy, wch. Ropf. ?lK-'I'f+H4, (Feh 1971). tt LS SA CS T'S DS

    c

    c

    c .- c < P 3 h (‘) c > r! il I 2 (2 r , F. Y. EYCAMS - -xtenda ble debuggina and monit.orirlq systzm. proc AFIPS 1969 SJCC, vol. 34, 567-580. rt FL 1,s cs L !?dl., J. 3, ‘1‘f.wsStofm tiom;: the extension facility of PTOtpUS. SIGPLAN NT)tic+s 4, 8 (Aug 1969), 27-31. u FL

    < c s 69) Chrjstensw, C., dnc? ~hnw. C. J., (odls.) c ?roc6+dir~Js of the+ exterrsiblf? lanauages symposium. SIGPLAN Notices 4, 8 (Aug 1969). # Ir’L CS

    c

    Lcavcnworth, 8. Y. Svntnx macros dnci extwded translation. c AC3 3, 11 (Nov 19&6), 790-793. i t F-1 TE <%3 Via> Poherts, L. G. 4 araphicd. sczrvice system wit-h variable ymtax. C ACM q, 3 1Yar 1366), 173-176. #f LS EL

    ’VImon, F. L, SIMT, a :-iatc? Li tp interactive graptiic tcrmina.1. I'roc ACM 23rd Natl. Cmf., P-58, (1968), 499-509. tc ;?P its !Wtterfisl!?, J. F. Viree dim-xsionnl telcvisiun. Payer preS:;pntchd (zt thtl sPIE l5th Annual Tec,h. Svxposium, Anaheix, CAlifornia, (SW 197fl). t ;! s Ctlrrv, J. F. I\ table input'faCi1it.y tor an interactive qraphics .“>vst em, Irlternat @ I Cont. :)n Artificial Int9lliqencc, (May 1964)). It ‘-Is Fxtovskv, !'. I?+sicrn of a display processing unit in d multi- Wrminal Pnvironment. l?v,cartmc?n': 9f Computer Sci.er:c6-, UnivQrsitg of ?llicois, Fept. hJc). 34 7, (Jul 1969) l

    tf IiS

    h'nudson, IL, and Vezza, A. f?+3rotp con,Putor Csplay tprminals. C.xq)ut.er Handlinq o f Grapfiical Information, (1970) v 24+2?3. # iis

    <"! I kWl> %rks, 9. P. CinPtron: apnar?!:+ 3-I) pictures wi+hout :Ilas:Tps. I?jformntion Displays 6, L (Ynr 19691, 69-72. 44 I'S qvcr, ‘I!, U., a19 Sutbrland, ?I. E. on the de’7 iqr! of -li.s@a\y prowssors. c AC-I? 11, 6 (Jun 19ci13), 410-414. ZI HS

    ,Droc AFfP:7 19Vi WCC, vol. 27, 819-8.30. 2 HS

    i < ';i 71) Sirnons, A. EITDOLYZ~H: a fm rl wdrc, realization of corltext-auidcd nicture internrehtion. lJ!i iv. of Illinois, Computer Sci. Dept., Yept. No. Q'lF\, Ph.D. Dissertation, (1971). hb HSIA

    ( s s 6 2 > p-moull, ?. F., and Sutherland, I. E. A clippina divider. Proc ATIPS 1968 FJCC, vol. 33. - t f?S

    S+PtZ, 2. 4 new.fispl.ay terminal. cm~u+‘cr Der,ian Yamzine, (Apr 196W. f IIS

    (5:: F-7, stotz, R. L, Cheek, T. R. :! lo'vs-cost crrnphical (lispplay for a computer time-sharincr con so 1 C’. PI-OC W.L F;atl. Symp. on Informa tiorl Display, (1967), 9 l-97. # 11s L ( ‘1’ 5 6 8 b T-bixeira, J. F., and Sallen, !?. P. T-1. SVlVa?i.t3f-2 Tdbht: a now approach to qr@lic inpiit. i’;oc iPIP:; 1960 SJCC, vo 1. XL P T!S Thornhiil, D. E., Stotz, Foss, Ward L fin inteqrnted har?warf? - software svstem tor comf)ut~?r graphics in time-sharing. Project MAC, KIT, MAC-TP-56, (Dee 1968). fi HSLS Yadsworth, F. F. I‘EPR: a hardware descript.ion. c PFc-ruirlq !.‘onc*pts in Computer Graphics, SecreLqt anntl vi ~veruc? 'It, (:;ds.), 2, A. Wnjamir?, TN., NW York, (1%8\. (I FTS

    'vlx4, ,?. 7. Graphic: o\ltput porfnrmance of t/e AhDS tlr‘rminnl. c Project MAC', FIT, MAC-M-368, [Mar 1968). # PS

    c

    Tillc7q6? analy.c;is, pnttem recognition, picture procczssi 14

    nit, Digital pdtttd-n r~coallition by moments. J ACM 9, 2 (Apr 1962). 240-2'3. # IA

    Ar:d.?rson, P. r-i. L Svrltax-direced rWoanition 01 hand-printed +wo-dimen::ional mathematics. WC Division of: Engineering and Applied Physics, Harvard Univwsity, (1968). 4 TA ?!I!4rews, 'L C. Qrrputer techniques in imaae procc?ssina. !Wndcmic Press, New York, (1970). tt "? TA

    Arkadev, A. G., and Rraverman, E. M. Comput-?rs and pa+.txn recoanition. Ti-1 r)F r>son ?ook Comnanv, (1966). # rn- N.1..31soe and Frowning Pattern rL>cnqnition and r-eadina hv machine. proc APIPS 1353 F;ICC, vol. 16, 225. rt IA 13lCi1SO~, Pt al. Piscussion of problems in pattern recognition. 233. i Proc F,FTPS 1959 SJCC, * TP ~antm, J, S. Alpha-ntimlric chdractpr recoanition usinq local oocJrattonn* Proc AFTPS 1959 FJCC, vol. 16, 21% f IA

    Wammar fx a pa tterri description language. r; 3 II t. l of WmputCr Sciance, Ilni vcr;Tity of Tllinois, Ye! t. No, 177, (1965) . * IA

    < 14 I- 7 c > r_?r-ecI!ina, K, J. P.43EL - a pattern de.sr:ription lancruaac>. 0tli.o Stat? 1JnivcrF;ity Flectrosci. Tati. AD 714 594 (1970). # TA LS

    < flit, t', !!> 31&i, F. :I. , nnJ Jart., P. F. Fxpcrimcnt: ir, thq reroqnition of handprinted t.r?xk F,*rt II - context. analysis. ?'Tnc 1\.FTP", 1368 R?CC, vol. 33, 1139-1149. * TA T)u?a, P. o., and Hart, P. F. 9+twx classification ard scmc C3nalysis. Artiticial Intelliqence Group, Stanford Research Knstitutr, %~lo Park, Calif., (Dee 1970) . tt IA

    < i’ 1 i, 1 > VYr?, M. ‘)!\I the foru\r?lizqtion CJ~ ilandwLitina. Prac of symp. in Applied Yathematics, Amcr ican flathematicni Cociety, 12, (1961), 83-N. ft TF ?I\ l f? *.I r, 2 > Ec?n, Y. Handwr it irig and pattern rebognit ion. 13E Transnct ion:; on Intormation Theory, R-8, 2, (??!h 1962) , ?fiO-166. ti IA :‘a 1 k , C . Computpr intprprrtat ion ot impu-ff-ct line ddtd ds rf ttlrrv- d i 17 e n s i 0 n if 1 s c ~2 n f? s t. a I! f 0 r d ‘Jnivwsitry, Ph. P. Dissertatiorl, (1970). # rn

    Vie linuni~tic nprxoach to pattern ar,alysis: a li+oraturr, surwy. TOorator~ for Pltc+rosciwcP Eiesearch, Dept. of Elect ricnl Fnainesrinc, :?cw York University, TR 400-133, (196t3) . it ir\ L PPd

    L ti IA

    t 77 -I ‘7 c L- ,T . l,i naulst ic sL3ccificat.i on dnd analvsis of c1asw.s 0 f line fmt.twnL. TCNorntor~ for: X?ctroscience Rewarch, Wpt, of Elpctricnl Vminwrina, New York l?Cvrrsify, TR-403-2, (QJr 1'369\. * IA

    ?.-wrmn, A., fbmo, T. .C;., Posent+4d, A., (3 3 d v a n WI n: A . , (c3s.) Cwnpu tcr araphics and imaoe pmcessina. c Acaderric Press, Nthw York, (1972). fi T.4

    Gar‘nett, .I. M., (CL) Confwenc-7 record of +he symposiun: on feature extractiorl anJ wlection in pattern recognition. T?XF Publication 7OC51-1:. Arqonm, rll., (Ott 1970). 11 T4 c r!.lll, n, ,I. , sa! 1, G. )I. , wolf ,, L). v., (and Fusebis, J. W. PiWI%?JRDE -- ijn in trrwztive qrnphics patt.Prll-rec~):lnitiort system. TnformatioE I)ispl:iy, (Nov-Dee 13b8), 45-4q., SYT. Project 6737. # rn

    I!nrmon, L. TL , and Knowlton, K. C. Picture processinrr hy ComputPr. Scipncel64, (Apr 1969\, 19-29. * rn

    Wwkins, JI K. I~aqe proctissino principles and ttichniqnes. 1 I? Tou. J. I'.* Pa.) # Advnncczs in Information Systems Scie,D.ce, vol. 3, Plenum Press, New York, (1970). P ?A

    <:fn 70h> Hodcs, L, L A proq ram!rtinq .svs+em for t.hr ,?n-line analysis of ~iiom~dtlix~ ir(;affcs. c: AU?? 13, 5 (?ay 1970), 279-283. tt TA

    ( ;ir?, 4; 7, Ill? , Visual pattorn recoanition hy moment invariants. TX Trans. r)n InformH.ion Thxx~, !3 (Fpb l%2), 179-187. # IA

    Rc+ztxirdt, W., (Pd.) ?roc6?ssinq of optical data by oryanisms dnrl hv machine:. Academic Press, Ww York, (19fi9). * TA

    e

    <,';d f;2> Sdest ygn, G. R?ecisjon inaki nq proced urclts in pattern recoynition. ?Icc;raw-f!ill, N&w York, f 1902). # IA < s ? 0 j :, Si12w, A. Cf., em?. YiLLc\r, W. F. A aicture cakulus. k~rnerqina Concepts in Computer Graphics. Rctnjamin, New York, N. Y.. (1%8), 101. * TF IA

    cs;i 71> Simons, A. Fl.f:CIT.YZFR: d ha rdwnre renliz*Oior; OII context-quid+=5 i)icture interprpt3tion. Univ. of T lli tmi s, Computw Sci. Dept., Spt. No. WI& Ph. D. Di.ss;;rtOion, flW1). h YSTA

    <‘;t 7 1, St ucki, P. Picture process ins tlsinu a general-purpose computer syst.cm. IL{ ‘c1 T. J. Watson ?ewx-ch Center, PC 436, (19711. * IA

    1

    PAGE 10. I

    c

    < ? t M%i> Ah dams, P. 'L, d- nl. ?b LISP proyrammin;r lanauaqcs 3nd system. Proc AFIPS 1466 KKC, vol. 29, Spartan Eooks, New York, 6bl-676. ft 1,s Ahrams, P. S. Ar: interpreter LOT Iverson notation. Tfl:? T, J. Watson Pesearch Center, Yorktown Heiuhts, N. Y., pay 1966). * LS

    Ahrams, n. S. A--I WI. machine. Ttxt,. Rept, CS 70 - 158; Computer Science Dept., Stanford TJnivwsity, (Mar 1970). Ic LS

    < 1 d 6 8 b h?ams. n. A. A coADut.at ion !r~odt?l with ;Iata rlow soquencinq. i?-.?ct. No. c-s-117, Computsr Scicl;rxf2 Dqxirtmcnt., S&ford Vniwrsity, (PC 1968). # TF LS

    < 91 5 Q> !?2ckus, J. 3. The svritnx ar:\i :

    3x-nstein, M. I. %ftwnrt? for interacti v4 graphics input. C*omnutcsr T!andling of Grilphical Intormation, (1970), 29-40, tt LS < pl!d c,tib> WrnstGn, "?. I., ancl Williacvs, T. G . I\ two-dim;tn:;ional pL.ogrammina system. ?roc IFIP rorar~ss 1968, 586-592, # is

    Hvrry, D. M. * ‘\ t\ importance of implementation models in Ala01 68, of neco:ssary cnvir0nmW& or bow to c?iscl,veL. the concept SlGPLAN Notlc~s 5 (Scu 1970). n LS PH

    i Pwhm, B. h'.. Lamb, V. P., Yoblev, F. L., and Piebt?r, J. F. POGO: pr,~Qr,i~~'r-ori~\o.t~d qraphics ocwration. FAND Corporation Memo. RM-SH25+R., (1969). #LLs -

    t!c;nd, 5?:. , W d. Fr)RYAC, an exp2ri11:entd 1 tormula mnipulation cornpi hr. Proc r\C:a lcith Nn tl. Cont., (AUCI 19641, k. 2. 1. it: LS Prc>ed , 14. M., 3nd Latbwr311, it. fi. Tko inplepentation of APL/3h& . IVzractivQ Systwns t'or Anyli?it Plathemati.czs, Acadimic Fress, New York, (19691, 390-399, f is

    (tip” 63, :jrt,wn, 'Al. s,, ;-'vijr, J. T., ad T~cIu~, H. A. ~hp AL~~K sv,stem tor non-nwwrical alwhra w-i a ifiaital c )rnptl txr. Poll sys. TT!!. J., vol.42, (l963), 2081-2319: ~311 sys. ?ach. rJ., vol. 43, (1964). 785-804: r-jell sys. ~cxh. A, vol. 43, (1964) p 1547-1562, Ir LS C'batham, T. E. The tbeorv and contruction of compiler; excwpts. Comxter Associatzs, Wakefield, Mass., 2nd edition, (1967). # LS 'IF: c <(:fl h5!>> Chc~atham, T. L, Jr. The 'KS-IT translator aenerntor svstem. PI-oc JFIJ? ConcJress 1965, 592-593. ri LS c Cbeatham, T. L, Jr., and Leonard, F. An introduction to thc3 CL-PI proqr?mminq system. Computer Associates Inc., Rept. CA-6307-ST!. (Aua 19631. t LS Ghan, F. C., an:? 9ouqherty, F.,L. A 5vstt;m for implsmcntjncr interactive applications. T'iY Svst J 7, 3 5 4 (l%R), 257-270. tt LS .

    ChGst.ensw, C. An exammpl-+ of the manipulation crf Grcxterl uraphs in tb L A‘WTT/G pro(7rcfmmin a lnnquacw. YdC.'.a. - Computitlrl Assoc., Div. or A~~pl. Data F;es. TnC., 'vJnkefieLd, Vass. (_vov 1967). +I TE LS

    rlowc_T, M, 8. r\ qenerative picture Grammar. Cc>mputing Research Section, Commonwealth Scientific ar,ri Industrial. Psearch Oraanization, Seminar Paper Elo. 6, (19671. t ‘,s 7-u ccYd.la, P. G. 9 1nfiquac.y for +dime~sional aeowtry. IF? Svst LT 7, 3 G 4 (1968), 202. ?t LS

    < i:y 79> Crespi-Reuhizzi, S., and l?orprrgo, 9. A lnnauag~ for trcatinrl arapbs. c A c M 1 3 , 5 (.M,nv 197(l), 319-32.3. Q ts

    T)ahl, D. , anti Nvanard, K. SIMULA - an AI.WLthas+d simulation lanauauc? c ACY 9, :I tsC%D 1966), h?1-67% 0 1s 51 cs

    f;>- nodd, c,. :;. ?PI - a LIPZY\IC~~ for associative !?att handlina in PVT. Proc AFIP'.; 19hG FJCC, vol. 20, Spartan Hooks, :I 'w York, 67795%. e LS c WtfiTi, J. ". A langaq;~ for line bawina. PL n. Disr-;ertation, Uciversity of Toronto, (Mar 1c)7c)). # 1,s I

    Evarls, T)., and Van lhm, A. nitn structurt7 Drxranlminu system. Proc TFTP Con~x-es~ 19511, 2. tt LS DS

    Fd\jrnan, 3, A., and Rovrcr, P. D. An associatiw? prwx?ssina system for conventional dirJi+al computers. "N WG7-lQ, Lincoln Lab., UT, Lexinaton, !!aw., (1967). 0 AS LS

    Floyd, n. 3. ,I descript ive lancruagc tar symbol manipulatiorh J ACM 8, I, (Ott Oct. l%l), 579-584. * LS

    L- < Gfi 71) Gwrqe, J. F., and Saal, FT. J. A command lanctuag~ meta-system. Pf2urtfi Hawaii Intprnnt~l Cont. on System Sciences, 44304p5, (1971). u LS

    < i; r 6 7 ?J > fZufxbera+r, Y, (ea.1 7-,mpu+er uraphics: qtility/production/art. ~horcp~on ,?ook Co., Lwhinqtgr!, C. C., (1967). u PH 1,s

    Wnhxson, 9. A., Jr. A waphic.; ilisplav lanqu30c\. T;+ p t. . of fTomputi\t Scbnce, University of Tllinoi~, F(-ut.L No. 240, (1367). rl LS

    < YIi) 7 0) Hxtldn, G. (*. ~‘\c artist views discf->verv throuah conputm-aided qraphics. &mputers and Automation 19, 8 (Aw 197c)) , 25-26. * LS FH (55 70, Wrzoa, EL, ar?.d Shndko, Ft. T)?l'viL 7r): a mmpu ter qrnphics lanquaae. .hfichiqan fJnj.ver';ity CONCOW Project AD 715 952, (197C). * TaS

    <:!I: 70, X~irto, 0.. ac?! l?az3ry, FL A forud .~~sCWU for irlf9rmation retrieval from files. ” ACM 13, 2 (Peh 1970), 67-73. 3 LS

    r;?AF: graphic additions t3 FOF?'RAN, Proc AFIP.'; 1467 WCC, vol. 30, APIPS Press, Montvnb, N, *f. PAGE 10. 11

    ?v+-!rson, I(. ?. A yroarnmminq lanyunp. John wilev ant? Sons, Tnc., NW York, (1962). t LLC, (13.” r,?> I3K Systens Journal 7, 3 6 4 T!!P whole issue was devoted to computer graphics. * TE LS J,)deit, 3, G. S+t)racre oraanizittion in progrdmcir4 sYstefls. c M'll, 11 (Nov 19W), 741-746. t DS LS

    Tqteraciive graphics in data proccssing: principlfw of interactive systems. TfrY Svst ,J 7, 3 C 4 (1%8), 147-173. 44 LS

    < tlo -7 1 > ,Jf,hnston, 3. R. T F, 63 f ontoljr ~o+1 of block structure processes. I‘ c 0 c1 of Svmn. on @atn Structures in Programmina Luiqunq~s, SIGPLAN Notices 6, 2 (Feb 1971). 4 TF DS SI LS TF <.70 69b> Jorrar,d, P. - Some aspects of BAWL, the base lanauage ror an extensible lanauage f aci Iitv. SIGPLAN Notices 4. li (Auu 1969), 14-17. w EL LS cs L!vra~ul, Y, and tic'un~r, 1'. Some aspects of the structure at HaseA. Drown University, ProviCence, H. I.. (Jan 1970). r LS UC.3 70.3, icveU, S., (31.) Picture l.knauny+ machines. ?racwdinw of a Contcrence held at Austr.qlinn National hiv., Canberra, Australia, I24,-28 Feb. 1969, Acadedc Press, New York, (1970). It TE LS

    < K4’ !+8> K~.~11oacr, r. r-i:‘, A natural lanyuaao compiler for on-line data management, Pr3c AFIT?'; 19f;3 vcc, vol. 33, 4710493, 8 r,s

    < iill 9 c; ' Knowlton, K. ('. A proarammer 's descri~*tion ot L6. C ACM 9, Q (Auq 1966), 016~625. # Llc

    < I, i‘ !’ 65) X.mt~, C. L, Polansky, IL H., and %x& D. T. S3F.P ~x~oriments with all al.crorithmic araphicnl lanquaq~,. Syst. PlTT Memo, (,4llcr -I QhV . L Z?I,-TM-22fJ, Cloctr. Lnf\,, Tech, * LS Lzvxnnce, N. A compiler languaue t‘or data structures. Proc AC’! ?3r? Nnt.1. Cont., Rrnndon SystemLr, PrcJsc;, *c Frirlcpton, N. J., (19681, 387-394. ?+ ns LS

    Lawson, H. W., ,ir. Pronr~~minu-lanurlnq~-~ri~n~~~ instruction strcdw. TFFF T ciln:-; . on (:omputtr~rs, C17, 5, c (Yav 1960) , 476-4'js. P LS

    ;,was, ?., Laucr, P., ard Stigleitnor, H. Y-t hoti a rr 1 nc>t.atian t‘or the formal dc!finition ot prof3rammin~ 1 aIrluU;10F!S. ItTIn i,~bor-jtr)rv Vipnnq, TP LS.087, (Juri 19hP). 4 TF 1s

    YcCar+hy, J. A formal iescriot-ion of a subset of ALGOL. Stool, Jr., T. !3.. (ed.), For-ma1 I,awguaqe Dt?scriptior!s - ?,:imu3qes r'or Computer- Erogrammina, North-Holland ?u\d. Co. , Anst~,r;1am, Tk? Nctwrbr.ds, (WfiO), 1-7. f$ LS I-' A(; F' 1 0 . 1 5

    ?Ic!i(fCIllarl, k’. Y. 91; approach to cOnlput(x hnquarrc design. I?cpt. No. C'S-38, Computer Scienc? Pfqartmw& Wanford Yrkwrsity, (AIICJ 1966). t PI? LS c

    < ?? t‘ r'; 4 > i?-dait t., J. E. A &aractnr con;pukr for hiah-kvd ldnfluwj+ i~t.crprctdtion. ?~:l syst 7 1, 1 (1964), 68-78. # TF T,S

    4, \I !WiJll, A., c?t al. Tr.t’or‘I:dtior: Pmxk3ssinu Lanquaq~-V, Manual cw:onii eGii.tior,. Prcntic> iidll, TIlC. Fnc!lwood Cliffs, New Jersey, (1964). t LS

    Olrt hfib> Nwman, W. 5 k rwriote qraphicdl display console system. '~roc AP'LPC 1365 FJCC, vol. 27, 839-846. ft LS PS

    iT:i i 5c?- Ni:lko, W. H. Graph ic I - a rt?md.c cxaphical display console systw. proc AFIP.; 19b5 P,JCC, vol. 27, Ft.. 1, 8390844. u LS

    - Ninkn, W. tl. Man computer araphical communication. In System Analysis by Diaital Computer, Franklin F. Kuo anil ;I . F. Kaisw, (Etfz~,), Wiley, New York, (1966), Ch. 12. u LS < ?4 VI.0 Pankhurst, P. ,7. S'JLP -- a compiler-compiler t‘or verbal and graphic lanquacres. QY-K ACM 23rd Nat.1. Cons., I196fQ I 405-421. Y I&S

    Pankhurst, 3. J. Cornpi t.er qrnpttics. In ?'ou, J. T., (cd.), Advance in Information Systems Science, vol. 3, Plsnwn Press, New York, (197(I), 215-X32. if LS

    i+n qrammxs. Proc of the International Joint Conference on Artificial Tntelliqencr, (?!a? 1969). Also as Univ. of !?aryland, Computer Science Center, ‘li-ch. F+pC-. No. 63-W, No:x-Sl44 (OO), (Ja ri 1969) . u rr\ T.,c

    < F;C? 04) p Is;:;, I). T. AFP JR. An 9xwri.1flwdill ldnyuaoc. processor. 'SL-TE-211, i?ioctronics Syst. Lab., YTT, CIambridue, f%vc--3 3. * (1964). a LS fiP CL?0 5cq:1> F0vt7cr, E-J. n. An Amkjit./S pr0qraKmir-w Ianyuaqe inplwnentation. I??' Lincoln Laboratory, (Jun 1968). t LS

    < :? !y 6 ‘3 ) ?ovner, P. r)., and He?d?rsor+ D. A., ,Jr. On +.hc imr~lc!m;zntat:ion of AP!BJVG: A arapflical Droarammin[r langunqe. Preprint., Lincoln Lab.,-Lexinaton, yass., (Feb 196%. 4 LS

    < 31: 7 lb Mlifcon, J. 3. 3W prccJr3mmir:q wncepts. Artificial Intelliacnce Grow, Stantord Rese;trch Tnr,ti+ute, Fxh. Note 60, (Auq 1971). # LS CIS

    r\r?iticinl Tntctlliqence Group, Stanrord &search Tnr;titutF!, TWA. Vote 42, (Ott 1970). fi LS CS

    < S? ;5 ‘!> Srtterthw.lita, F:. ??TITAN% O.5, aT: cxpwiwntal proarnmminu hnuuacr+. $.~Pf-. No. L-s-lL0, Computer Sci~ncil, Department., Stanforii Unlversitv, Stanbwd, Calif., (Feb 1969). # 1,s c :,1 71b 3

    , Schwinn, n. V. ,I\ pro k&m oricJnt4 ornpbic ldnc~uaae. Proc AC4 %2nd Natl.'Con+., Y-67, (1967), 471-477. ft LS L

    Sawa, F. J. Graphical data process ina. proc: AFIPS 1968 SJCC, vol. 32, Ill-11tL c rt LS

    Standish, T. .IJ . . Programnina lanuuaa~ design criteria and trafb-offs. P3petrs KS-~, Comprr ter Center, Carnegie Institute of e Txhnoloqv, Pittsburgh, (Feh 1966). t TE LS P:I

    5trirxJish, ?. .4. s>;lle tPnt.urP:; of PPL, d polymorphic vroqrammina lancruaac. SIGPLAN Notices 4, !3 (Auu 1909). 20-26. P Lti x'. .? t. Chk??\ !+?el, 1'. D., (WI.) - Formal lanauaw description lanquages for computer programnina. Horth-Holland Publishing Co., Amsterdam, (1966). Q LS DS cs

    Strachev, C. Fundamentnl concepts in programming lanquaaes. NATO ConLw?nce, Copenhayn, (1957). # 1,s A PIHLLOGEAPHY ON CWIPUTER GRAPHICS PAGE 10. 22 Lilpquages t; systems

    ?t_ractsv, C., Rdrron. n. Irl,, liartley, D. F'., fiuxton, 1 N., and Yixon, E. &L biorkino Papers, IJniwrsity of London Tnstitute ot Cornput-+; Science and The Mathematical Laboratorv, C-imbridqs, (Jul 1966). J LS < s Y 7 :! > *Sussn!ii n 7, J and Mcllernott., D. V. Wy conkivino’k better than platminn. i'!IT firtjficial Intellj uence Laboratory Memo, No, 2Li5A, (W72). * LS F f? S!ltht\rlanfl, 1. F. SSl?%Cl!FAD: A mu-machine graphicd communication st'st~~~. P&&AU?S 1953 WCC, vol. 23, Spartan Rooks, New York, 3?-246. . A more compl’ete description is contained jr-.- . Tech. Popt. No. 391;. Lincoln Lab., MIT', texington, M .3 s s . I (Jnn 1963). It LS

    CSu U60 Sutherland, L R. The CoBAl 1wwatQf) and data structures. ME Lincoln Labor.3 tcirv, T!?l)OS, Lexington, t4ass.v hJan 1966) . # !?S TE LS <%I Fi7h> Sutherland, L F. lanquaqe structure and graphical man-machine communication. -Proc of t.G 3rd Conq. on the Information Systems Scienc:e and Technoloqv, (lY67), 29-31. it LS

    < Tit 6 6 > T,\twrv, P. Sunwy anti k?v;ilunti.on ot AED ,r,y~t(~ws at. MIT. rf-ch. Re pt.. T?-00.13R3, X?lM Systems Devlopment Div., PowhkeepGe tat)., Pouahkscpsie, New York, (Fet) 1966). # LS (‘A c < 7' i. 6 6 > ?ichro3w, P., nr-4 Luhin, J. I;‘. Computer simulation -- discussion ot the technique? and comparison or lan3uages. C ACM 9, 10 (Ott 1969), 723-741. e 4 LS ST PH <“- tjf,, TQtQlman, W. PTL@I’: a step toward man-computx symbiosis. Project MAC, fiassachusetts Institute of Twhnoloqy, Tech. !+pt.. No. MAC-7’3-32, (%?p 1966).

    < " 1“ 7 0 \ Thorell, C. S., and Poteat, W. 0.. Jr. A basic list-oriented information structures syst0in (FLEX), M. s. disswt.3tion, US Naval Postaraduatc School, (1970). t LS <‘?t (:‘4i)> ‘;‘.tornhi 11, D, E. VAX.iYS for ARDS. !!?IT Flcctronic System:; Laboratory bmo. 71435-M-318, (Jan 1969). tt LS <-y

    Ttlornhill, n, E., Stotz, Ross, Ward An int.ear,qted hardware) - softuar.p system for computw araphics in time-shnrina. Project. MAC, MIT, P?AC-TP-56, (kc 1968). it I-iSLS

    < “r, 7 1 > %\I, J. T. , awl Wjqr-wr, P., (4s.) .I\.?! wmuo+ uff on *-Iatn structutc~S in progr3mmiI!a lnnquaaos. iT:liveL‘Sitv of Florid?, (1971). u LS rs cc; PI! Vim Dan, I\., ;rnd Evans, @. Dn+a structure proqrnFmir;a system. E'roc 1FIP Con~rcrss 1968, 1, North-Holland Pub. Co., Ansterdas, S37-564. s DS L."> Mlker, S, T., bind St:ick, 'I. 2. AInS - advancc?d interactive display systc~. Tkpt. ot w=fmC~, 416 Bryant Ave., Laurel, MkV # 1,s Wct-Tner, P. Ttic Vienna definit ioa language. “J’? 7@-21-2, Center for Computer and Tntormation Sciences, F3rown [Jnivcrsity, (&IV 1970). ti LS c <:?SS 70, Wg-hrli, F., Sari+, ?I. J., and Smith, F. F. IrtiCATD: t.he architect% computer araphicx aid. Computer %ience Dept., Universitv of Utah, Salt Lake City, Ut.ah, Rept. No. !J+?EC-CSc-70-102, (Jun 1970). t LS

    < It ;3 !i 6 k> vi *? iz e n ba u PI , J . Svmmet ric list processor. c ACfl 6, (1 (sty WCih), S24-543. 4 TE S3 LS i < ‘d t ’ 5 4 > wdls, Y. P. Aspects of larkauaue desiy for combinatorial computina. Ii?EF Trans. on Plectr. Computers, K-13, 4 (Rug lcj04), 1111-438. * LS

    < Id c 67) ;Jnxelblat, F. L., and Freedman, H. A. The MfJLTTLA?lG on-line proqrammina svsb?m. rroc AFIPS 1967 SJCC, vol. 30, AFIFS Press, tiont.vde, Ni?w Jersey, 559~Sh9. t LS AP

    < w i h 9 > :GiJliams, 0. A .‘;urvev 4nd (3n dnnot;It.w3 bibli ogral+y ot data stmcturw for computer arnp3ics. T5-403-6, D@pt. of El~xtri.cal Ermi neprinu, New York lJni.versity, (Sep 1969) . t LS DS

    < K i 7 lb> idinomad, T. Procedurw as a reprewntatior, tar data in a copputm pr-oqram for wder3tnndinq natural lanquay. Project M4C, rassachusetts Irstitutc of Tcchnoloav, 'I'Pc~. Rep+. MAC-W-84, (Feb 1971). 4 LS SA CS I'S DS

    < !dJi 7Oh> 'kinston, >I i!. Lcarninu structural descriptions from exan~ples. Project. M4C, Ilassachusetts Ynsti.t.utc or Tachnology, wpt. No. UK-V-76, fSf?p 1970). * S?, LS TV in multiproar~~mminy, machine coding, and computer organizat i on. c ACT: 12, 9 (Set' 1969), 48904’M. t P,P LS

    t ?II TE

    B;is;kin, Ii. R. 3 compr;3h;?nsive applications wthodoloay for symbolic computer maphics. Port imnt. Concepts in computer Graphics, Tlnivrrsity of T:llinC.r, qress, Ilrbann, Illinois, (W69). f PH LS AT-' TC c < TIC 7Oc) wrry, P. Y. VW importance of implementation models in Ala01 68, or how to discover the concept of necessar.y wvir~~nmw-0. SU;FLA?I Naticps 5 (Sf?p 1970). # LS PH i ( ?L’ 70!> u'+hrry, D. F. J3lock stfuct*lr?: retclntion or dclMiort? 7-F-i 70-24, Cwter for Computer dud Information Sciences, Mawr? !Jniver;ity, (IIec 1970). L # PH 054 TO> ~~TIIIMX, J, S., Goodnow, ,J. J., an:1 Austin, G. A. rl study ot thinkinq. Wilev, New York, (195f)). t “H c

    ( I’ .: h7) rw'cro, H. , (and Slotnick, D. L. 5-J rl c t t!OU~TJ t1+s on iiisplays. 33prainc7 f- 0 r1c ‘.I hut s ir: Computer Graphics, Urf)ana, (1967) . LtL’“‘7 15:35:21 otU.33/72 A BXFLTOGFAPHY ON CC)!'lPUTER GRAPHICS PAGE 11. 2 Philosophy

    Coons, S. A. An outline of the requirements for a computer aided dt>sian system. PL-oc AFIPS 1963 SJCC, vol. 23, Spartan Books, New York, 299-304. t ?H CA < c ,5 !", 9 > Ciuri, C., and Shaffer, J. Art, computers and mathematics. Proc AFIPS 1968 PJCC, vol. 33, 129+1298. * Pr-?

    <3;? t.GVO Dpnnis, J. R, Programming aencrality, parallelism, and cooPputer architecturn. Proc IPIP Congress 1968, c 1 - c 7, w PH PP LS cs < 1; L 6‘5a> Di jkstra, FL W, Proqrammina consi?ered as a human activity. Proc IFIP Conaress 196S. 1, 213-217. t PH nijkstra, F. W. MTO statnment considered harmful. (letter) C ACiS1 11, 3 (Mar 1968), 147-148. 1$ PH

    < -7 r, 6> Xlis, A. P., and Tiedeman, D. V. Cnr. a uiact?ine counsel? froc C!?ED-SSRC Conference on Computer-based instruction, V?iv. of ‘Wxas, Austin, Texas, (Ott 196fI). 8 QA E'H SP, < ?? s 6 6 > Fllis, T. 0.. and Sibley, W. L. 0~ the dwelopment of equitable graphic I/O. RAW Corporation, P-3415, (1966). t TH i-,:15:21 09/-u/72 A BliLRLroG34 PHY ON COMP!J.TEH GRAPHICS PAGE 11. ? Philosophy c (25 rj7> !ZILis, ':. O., an4 Sibley, W. L. on tha pr>blcm of directness in computer qraphjcs. Proc from Cmer4i.n~~ Concepts on Computer Graphics, (1967). * PEE

    < Ef’ h 9 > Frl@ct>art, T). C., and Enalish, bi. K. A research center tor augmenting human intellect. Proc AFIPS lgijti F,7CC, vol. 33, 395-410. # PH LS

    Gruenbercyr, Y,, (ed.) Computer graphics: utility/production/art. Thompson Book Co,, Washinoton, D. C., (1967). if PH LS

    L : fro t-,7> !!xnbuckl '3, C;. JJ. The compu+.er graphics/user inttxtace. YEE Trans. on Human Factors, HFE-8, 1 (Mar 136?). it PH

    c R FTBJ,IOGRAPHY Obi C'OMPtlTER GRAPHICS PAGF 11. 4 Philosophy

    Cnntlin, P. J. ?he next 700 proaramminq lanquncps. C ACM 9, 3 (Mar 1%6), 157-166. Y rr1

    ( I- i 6 )> !icklider, ,?. C. R. Man-cc!mputer symbiosis. r’_‘;\IlSiI Ct i,,r!.s T 7 tie'f PGFIFE, IW'B-1, 3 (lsic;fl), % P*!

    Llcklid*r, J. C. R. Man-computer communicat.ion. Rnnual r7ovi.w of Inro. Science and Twhnoloay, vol. 3, 196H tt P!F 15: 3S:?l o/v/73. A RZHLIOGRAPHY ON COMPUTER GRAPHICS PAGE 11. 5 Philosophy

  • McCarthy, J. c A 'oasis fqr a mathemat.ical theory of computation. C9mputer nroqrammina and formal systems, P. Xnttortand E. Nirschherq, (eds,), North-Holland, (1%;). * PH TF WCarthp, J. c Prourams with common cwns5-2. Stanfor\ I\rtificinl Intelliuence "@Ft., Project M'Jmh AX-7, (Sep 1963). % FH SA

    > McPeeman, Id. M, L .7n approach +o cozy)utcr lanauaae design. J?!ept, No. CS-48, ComputPr Science bpartmant, Stanford University, (Auq 1966). # Pi! LS c <'V(cK 67> flcKe?eman, W. ;pLI. La Ii qu aqe Grecte(l computer design. Proc AFTPS 1967 FJCC, vol. 31, 413-417. )t PI! LS Cl0 700 Ycxri.s, I. L. tiuman factors f9r ict+lrac+ive systems. Comy?ut_cJr %mdlina. d of Graphical Int.ormation, (197@), 87-W. lc PH

    < :? '_5 7 0 > Nyc!qor! t -1, W . Th$ architecture pachine; toward a more human L cnviror!!nqr?t. MIT Press, (19701. 4 LS PH kJ"wc+ll, A., dr.:? Ernst, (7. The! starch for aclnerality. Proc TFIP Conrrr?ss 19h5, Spartar, Pooks. c A P H 1:/-u/7, A HIPLlOGHA F'ffY ON ('OMPIITER GRAt'f'TCF rwx: Ii. f, Phibsophv

    <:;rs 647 Vwell, A., brlis, A. J., and Schatz, F. 9. Proposal for n center for the study of informtion processincr. Carncaie Tnst itute ot Technoloyy, Pittsburgh, (Ott 1964\. rt PH ~Niwerqdt., J. Fixed vw:ins selt-modifying programs. Compu%r Tournal, 8, 3 (Ott 1965), 244-245. )t TE PN

    Pdpcrt, S. Teachinq children to be mathematicians vs. teachirq about mathematics. YIT Wtiticial Intdliyence Lab., Nemo. No. 249, (1971). it r?H

    <’ 6 i) 9> ?wnol:Is, 3. C. :;ErJAriK?N: (7 si~:pLe tvpelws lanquaqe which permits hnctiorxd data structures arid co-routines. tlL JOT’.!-!=? ?htioual Laboratory +pt. ANL-7621, (Sep 1969). ft LS SA "I' PY CS

    (i’7F\ 3: ,c p -I

    Skinnw, ? D. Computer Traphics --. where are we? Datimation 12, 5 (Hay 196G), 28-M. t PV

    <$rJl 72> Sussman, 7. I., and McDermott, III. V. #IV c:,nnivina i:; better than plannina. MI+ Artificial Tntelliqence Laboratory Memo. NO. 255fi, (1972). u LS PI-!

    ';-,:!i(:hropww, 9., and Ldin, J. F. C3mputcr simulation -- discussion of the techniqun and conrpariso? of Li nguwqes. C AC!? 9, 10 (Or+ v-%9), 7L.3-7'41. u LS SI PIi Philosophy

    var Tha, 4. t7orykter 1rivc.n displays /jnrl their use ir nran/sact\iw-> iOeraction. Mvances iri ComPutPrs 7 (1966). It PH

    < v 3 '7 (! b Vrlr. Dam, 4. Xr:+roducti on to uictuw codelinq. Comprltr>r bndlinq of Graphical-Information, (IWO). li)l-120. U DS PH

    < v I 7 1, V.III I'aams4or1k, F. J. ?!i-~ rcyrewnt ati on of three-dimensional o,[email protected] as tlcshed out stick t‘iaures. L..n SC. Th-asis , fJniv%sity of Toronto, (1971). 0 TE DS PZl -: v ‘. “,‘*; > V:)n Wrlma:rn, ,J. Ihf cr)mpu+cr -3rd the hrairl. Ydd~iwrsitv Press, Yew Haven, cow,, (WSR), t PH

    < * .- 7 00 :; -1 CT n o L‘ , F . Ttw viiriahilj ty of corrrnut3tions. I 'I- ' -7c-22, t+rt& for GupIi ters an? T cformation Scienc;rs, Yirown Wives si tv, (87~1 1970) . lt pry

    /- k ‘* Mi> i+ir:ston, n. ii. I?~lc?S. ;q T&., 7’ Projxt UT, A. I. !%xno. lh3. U PH TE c Yirfh, 74. Orxcrt ain hdsic c0nceut.s or praqrdmminq ldn4uaa~s. b?pt. wo. cs-65, Computc?r Science Departmwt, Stanford Univcrzitv, 5tariford, Cdif., (Mav 1967).

    4

    ~r:iikov, A. P. Parallel. nro~ramC.r~. cs-224, C-~mputer Scier!cn Wp~rtwnt, St.anford University, Stanford, Calif., ( J u 1 1971). 91~0 .S Panford A. I. Laboratory Memo. 146. f) PP

    prdlld ~ro~essiri~. ?r:,c k"'IP3 1967 &Kc, vol. 30 . U AS FP I

    15:35:21 08/?1/72 A BIBLIOGRAPHY ON ~Ol'!PUTER GRAPHICS PAGE 12, 2 Parallel processina

    Morton, F?. On-line cwvputing with a hierarchy of processors. Ph.D. Dissertation, University of Pennsylvania, Pennsylvania, (Aug 1968). # PP

    t&i 661) Hirth, N. A note on "Pro.lram structures tar parallel mocessina.'@ C ACM 3, 5 (May 1966), 3X-321. r PP f

    Cbrniak, E’. rmputer scdut ion of calculus word, prohlcms. PI-N Int. Jt. Con?. Art. Intel., Hashinqton, IL ('. , f1%9), 3?3-316. * I'S Fikw, $7. Stating problems 3s procedurw to a general prohl~m solving proaram. Proc 4th Sys+,. Symp., Case Wu:;tern Reserve University, CloveIbnd, Ohio, (Nov 1968). * PS Green, C. c‘. Auplication ofr thcorc?m proving to problem solving. Proc Int. Jt. Conf. Art. Intel., Uashington, D. C.. (by 1969). 219-239, # PS TP On Griffith, A. Coaputer recognition of prismatic solids. Ph. G. Dissertation, Dept. ot Plath., MIT, Cambridge, Mass., (311n 1970). # F'S IA

    Computer rccoqnition of three-dimensional objects iR a visual scene. Rept, MAC-TR-59 (Thesis), Cambridae, Rass,, Projecj YAC, MTT, (Dee l%R). t F'S IA T.onde, I!. L., an(? Simmons, R. F. IJamcr: a patt.ern recognition system for- wneratinq wntences abotlt wlations between line drauincrs. Proc AC‘Y 20th Nat.1, Conf ., Lewis Winner, VW York, (1355). # s;n TA PC

    Yc:carthy, J. Situations, actions and casual laws. -S+?nford qrt. Intel. proj. Memo. 2, Stanford University, Stanford, Calif., (1963). # SA PS

    < N .S 6 3 ‘B NWW~ll, A, , and Simon, H, A. VS, a proora:n that sieul3t.e~ human thouqht.. In Co~put.xs and Thowht, E. ?+'eiawO~aum and J. F@Mman (Ecis.) , f?cGraw-Cll, E!cw York, (1963). it PS

    Shapiro, 7. ‘1 net strw?.ire l-or 33nanG.c information storay, ~xIuct.ion dnd rei.ricwl. %i:;cor!lr;in Ilniversity Computer SciWXW Dznartmen+, y:-103, (N71), P ilS SA PIT A.C

    5i.h1ev, E. Y. , et al. ?'!c. CdSP for a g~~ner3Liz+d qrdf&iC protAt solvex-. i’.‘roc AFT?!; 1971) SJCC, vol. 26. rt ?S p f7 l.i:35:?1 W/H/72 A PIHLlOGRP.PHY ON COHPUTER GFAr'l!ICS E'AGF. 13, 4 ?Voblea solving

    Winoqrad, %. Proccdurer, as a representation tor data in a computer program for understanding natural language. Project MC, Onssachusetts Institute of Technoloay, Tech. Rep+.. NAC-TF.-84, (Peb 1971). t LS SA C'< E'S DS

    'w'oods, w. A. Procedural semantics for d question-answering @achine. Proc AFI'PS 1968 FJCC, ~01. 33, Thotapsofi BOOk CO., Wasbinqton, 0. C., 457-471. t QA PS I L 15:35:?1 OR/U/72 A RIPLIOGRAPHY ON COMP17TER GRAPHICS ,PACR 14. 2 Question answering systems

    CPU 72) Pumfrev, Y. P. (MS question-answering system.- Illinois University Computer Science Department, UTtJCDCS-R-72-500, (1972). ft UA

    R Rosenbaum, P. A grammar base que3rtion answeri nq proce?we. C ACM 10, 10 (Ott 1967), 630-635. ft OA

    tsi? 60, Shaprjo, S, C., and WoocImansec, G. H. A Ret struct.~lre based relational question answerer: dsscription and examples. Proc Int. Jt. Cord, Art. Intel., gashington, D. C.. jl969), 325-345, * OA

    VocwIural .smrian tics tar a question-answerinq imch in e. Proc AFIF 1968 FJCC, vol. 33, Thompson ?%mk Co., ‘d~~sT,hit~gto:l, I!. c., 457-471. * ()A E’S

    c

    lf;:35:Ll WI/U/72 A RTBLIOGF!PHY ON COMPUTER GRAPHICS PAGE 1% 1 Semantics 6 artificial intelliqence ingeneral.

    < n3 63, I\helson, 6. P., and Reich, C. M. Implication;\1 molecules: a method for extractina meaninq from icput sentences. Proc Int. Jt. Conf, Art. Intei., Washington, D. C.@ t SA

    IL OiS W? Aqh, L L., and Sibley, E. H. TRAEP - an in?erpreta+ive associative proc633or with deductive capabilities. Proc ACM 23rd Natl. Cont., (1968). Rrandon Systems Press. Princeton, New Jersey, 143-156. 1c AS SA DC PS c ration Memo. RM-52900ARPA. Condensed vwsion appeared in Proc AFIPS lYf7 FJCC, 31, 535-544. i tc LS SA Tr;: %cker, J, 9. The modeling ot‘ simple analoqic and inductive processes in a semantic memory system. Droc Int. Jt.. Conf. Art. Intel., Washinqton, D. C., (1969) l 655468. # SA TE

    Ronhert, ,1, G., and Rfcker, P. 0. Automatic English-to-loaic translation in a simplified model. VOljR W-1727 (AD-637 227), XIV! T. J. Giatson Res, Center, t Yorktown Ieiahts, N. Y., (Mar 1966). I# S1\ AP

    Clowes, M. 13. Pictorial relationships - a syntactic approach. D. L In flachinc, Intelligence 4, Mel+zw, B., and Michi?, (?+3s.) , A(ncarican Elsevicr, New York, (1969). # SA

    i 1'235:il OH/ U/7% A 2IRLIOGRAPf!Y ON CQr.PlJTEEi G$API!ICS !-‘AGF 1 5 . ? Semantics F artificial intelligence in aeneral

    Coles, L. s. ?alking with a robot in Fnglish. proc Int. Jt.. Conf, Art. Intel., Washing+3n, II. C., (Yay1969). 587496. # SA

    CDV 6J6> Dennis, J. B., and Van Horn, E. C. Pr9gramming semantics for multiproqrammed computations. C ACM 9, 3 (Mar 1966), 143-15s. rC SA TF CS r

    cva G 6 > "@ldman, ,J. A. A formal .r;emar.tics for computer Lawwages and its anplicat ion ir a compiler-compiler. C ACN 9, 1 (Jan 1966), 3-Y. # sn Ft=Idman, +I. A. Automatic prosrnmminq. cs-255, C:,mputer Scienc? Department, Stanford Univvsity, (Feb 1972).. # SA ‘;‘loyd, R, w, Assiqninu meaninus to prourams. Proc Symp. Applied Mathematics, AMi, (1967). # SA

    Gwrae, J. F. SARPSIS: syntax 3nalvzclJr, recoonizer, parser and semantic interpretatib system.- SLAC CG T:'l No. 34, (Nov 1967). # SA Ww itt , C. PLANNER iwlementation proposal to ARE'A, 1972-1973. MIT Artiticial Tn+elli~cnce Lab., ?kmo. No. 250, (1971). # SA LS Hwt, E. k, Irartin, ,I., and Stow, P. J. Exneriments in i nQcti.on. Acidemic Press, New York, (1966). # SA

    Kasher, A. Data retrieval hy computer: a critical survey. Whrew University of Jerusalem, (Jan 1966), Tech. Rcpt.. No. 22, Wf. of naval Res., Tnf, Syst. Branch. # s4 Kqtz, J. 7. Wcent issues in semantic theory. Fnundations ot Languaae 3 ('l967), 124-194. # SA

    n-iuth, n. F. ThP semantics of progL-amminu lnnguaues. Mathematical 5vstw. Theory 2, No. 2, (1968). !# SA 15:35:21 w/71/72 A BIBLIOGRAPHY ON COMPUTER G!?APHTCS PAGF 15. 4 Semantics & artificial intelliqenca in general

    Knuth, D.F. Staantics of context-tree 1ancJuages. Mathematical Systems Theory, 2, 2 (Jun 1968), 127-1'6 # SA

    Ledqard, H, F. .A formal system for defining the syntax and semantics of computer lanqwys Ph.D. Dissertation, E?IT, MAC-T-R-60, (Feb 1969). # SA

    Londt?, D. L., and Simmons, R. f/. bmer: a pat+ern recognition system tar aeneratin~ sentences about relations between line drawings. Drou ACEl 20th Natl. Conf., Lewis Winner, New York, (196%. 8 SA IA F5 Elnhahala, Fr. N. PreDroccssor f-or prwrms which recognize scenes. Ar'ificial Intelligence, tierno. No. 177, Cambridge, Mass,, Project MAC, MIT, (Aua 1969). It PS TA SA M(knna, Z. ProFWtiec of programs and the first - order predicate calculus. J ACM 16, 2 (Apr 1969). # TF SA RcCarthy, J. Si tuati&tS, actions and casual laws. Stanford Art.. I'nt.el, Proj, Memo. 2, Stanford Univcrsi?y, Stanford, Calif., (1963). # SA FS

    WCarthy, ,I. Proarams with common sexlsc. Stanford Artificial Intelligence Fept., Project P!~mo, AT-T, (Sep 1963). Ic PF' SA 15::vk21 W/31/72 A nIRLIOCiRAP)rY ON COMPUTER GRAPHICS PAGl? 15. 5 Sem3ntics & artificial int elliqenca ix clonerail

    ?IcCarthy, J. Definitions of nev data types in ALGOL X. AT,GOL Bulletin 18 (Ott 1964), 45-46. # SA DS LS

    floses, LT. Symbolic intcaration. Ertiticial Intelligence Project Memorandum No. Q7, PITT, Project. 3AC, (Jun 1966). # SA

    Moses, J. The function of FUNCTION in LTSF or why the FUNARG problem should be called the mvironmwit problem. MTT Artificial lntelliqence Lab., #em& No. 19% (1970). * SA TE

    c'Oi-'7 64, (IImy, J., P~vard , c., dl'd 7it f , P. Tf,warci t 1: ‘1 ~%wdopm~nt 0t cornput& ional aids f-or ohtaini ncr 1j f%r~;iL semapt.ic d~-!script.ion of EnaE.sh. S?2766/001, SK, Santa ?Wnica, Calif., (1968). fi SA

    @1illan, y. H. The-: twchable lanauaqc comprehender. C AC3 12, 8 (Auir lC)h9), 459-476. # SR A PviZly, E. T?., Jr., and Eaderighi, F., D. On reversible subrout.irws and computers that run backwards, c ACM 8, 9 (sep 1965), 557-558, 578. tt SA Tfl CT c < I?(\ 0 3, Ibvl1o1 ds, .7. c. f;Er)ANREN: cl simple t vpe 1~5ss lnnquaw which permi t.3 fllnctional &I tn struct urc‘5 and co-rout inss. Arwnrw Ndional T,ahoratory Hept. ANC-7621, (Sep 1969). d LS SA PF PH CS sLiltoIl, c;ernr!l Aut.omat.in;r information orqanization ard rdrieval. McGraw-Nil.1, New York, (1968). it SA

    Schank, R. C. c. Outlice of a conceptual semantics for qeneration of coherent discourse. TRACER-68-462-0, Tracer Inc., Austin, Tex., (!lar 3968). X SA Schank, P. C., an:'1 Wsler, L. G. c 4 conceptual parser for natural langaqe. Proc Int. 3% Cwf. Art. Intel., Vashinaton, D. C., (Wh9), 5690578. u SA Schwartz, ?. I?. c Towards a comwt~3tion41 forealizatiot~ of niltural L3nauaae :;emantics. Proc Xnt. Conf’. on Coinp. Linq., hdd in Sveden, (Sep 1969). u SA TF c SwrcL-Jonw, K. Fxperiments in scnlantic classification. Ycch. Transl. Comput. Linguist. S, 3 F, 4 (1965), 97-112. * SA c

    c

    Weizenhaum, J. ET.XZA -- a computv proqram for the study of natural l~lrcfuaqe communications between man and machine. C ACM 9, 1 (Jan 1966). 36-45. # SA Hhzenbaun, 3. Symmetric list processor. C ACM 6, 9 (Sep 1966), 524-543. II TE SA LS Wilks, Y. Computable semantic derivations. SP 3017, WC, Santa ?lonic:a, Calif., (Jan 1963). it SA

    Winoqrad, T. Procedures as a representation for data ir! a computer program for understanding natural language. Project M&C, Flassachusetts- Institute of Technoloay, Tech. Rept. MAC-TR-84, (Feh 1971). t LS SA CS PS DS tUi VJt>> Winston, P. H. Learniny structural descriptions from examples. -Project MAC, Massachusetts Institute ot Technology, Rapt, No. MAC-TR-76, (Sep 1970). f SA LS TR I _; : 3s:21 (?W/31/72 A tiIHLIOGRAPHY ON COMPIJTEP GRAPHICS PAGE 15. 9 Swn13nt.ics E arti f icial intelligence in awwral

    Construction heuristcs tor qeonet.ry and a vector. aWebra wpresentntion of geometry. YTT Project. PAC, Tech. Memo. 28, (1972). R SA TE TP c

    15:35:?1 OP/J1/72 A RX!!LIOGHAPNY ON UOMPUTER GRAPHICS PAGE 16. 1 Simulation

    <(;a 69, Gc>rdon, G. System simulation. Prentice Ual.1, Inc., Flnqlewood Cliffs, N. A, (196% * SI

    Rarkovitz, H., et al. sIKXPTPT marxal. kent ice-'~11, f Vt63). if 3 T

    Woodhae, R. D. Graphical computer modelling and simulation techniques. VAIDE, (1969). X AP SI 1’1: $5: “1 fw/\1/7% A f~Tt~T.TO~;FADtlY ON COr,PIjTE&: (;RAI'fjI.CS ?'txhniques

    Andrew, V. C. Computer techniques in image processing. Mzarkmic ?res-c;, NW York, (1970). X TF IA pcl, A. 'I‘b visibility problem and machine renderinq of soli.ds. IRM T. 3. Watson ?esearch Center, NW York, Rc,pt. No. EC 1618, (May 1966). # TE

    c

    k=>el, A. VwIelinq i.n three dimensions. IHM syst ,? 7, 3 6 4 (1968), 310-321. t TF Rnlzer, P. fl. Dataless proarammina. PAWD Coryorati.on Memo. FM-52900AhPA. Condensed c version aDpeared in Proc AFLPS 1967 FJCC, 31, 535-544. it LS SA Tl?

    c 15:35:21 08/33/72 A RIBLIOGRAPHY ON COMPUTER GRAPHICS PAGE 17. 2 Techniques

    Baskin, H. R. A comprehensive applications methodology for symbolic computer qraphics. Pertinent Concepts in Computer Graphics, University of Illinois Press, Urbana, Illinois, (1969). fi PH LS AE' TE Baskin, H. R. Interactive qraphics and computer aided design techniques. Computer Aandlinq of Graphical Information, (1970), 121-128, # TE

    Reatty, J. C. An axiomatic approach to tbe semantics of expressions, with applications to code optimization. TBM Systems Development Div., San Jose, TR 02.511, 11971). Cc TE SA Becker, J. D. the modelinq of simple analogic and inductive processes in a semantic memory system. Proc Int, Jt. Conf. Art, Intel., Washington, D. C., WW v 655468. 1) SA TE ~obrow, D. G., and F?urphy, D. I. Structure of a LISP system usinq two-level storage. C ACM 10, 3 (Mar 1967), 155-159. # DS LS TT;: I’,: 4591 OW31/7? A FIPLIOGHAPHY ON CQHE'UTER GRAPHICS PAGf 17. 3 Techniques

    c ??oukniqht, W. J. A procedure for qencration of three-dimensional half- toned comwrter araphics representations. C ACM 13, 9 (SOP 1970), 527-536. 0 TE I!rwdina, P. J., and p.moss. J. 0. Topologic31 manipulation of line drawings usina a pattern descripti9Wlanguage. - Ohio Stat? University Electrosci. Lab., AD 714 593, (19701 l cc it ‘TE

    < 3tl 6 F;) xlrstall, r;. M. A tree search j nu methoi! for solvina integer, linear inqualitics. Fyperimen+a!_ Proarammina Rept. Ko. 10, Universitv (Oct. 1935). i ot Edinburah, 4 TF

    Carlborn, T. Alaorithms for tr.?nsforminq PDL-expressions into star?dard t form and irl+o a primitive connection matrix. CG’?M 3% (1968). c StanfordLinear Accelerator Center, No. # “F1

    Carr, C. S. Geometric modelba. Computer Science Dept.. , University of Utah, sdt. fake city, Wah, Tech. Pcpt. No. TII 4-13, LYur! 196')). t 'F LS < i‘t; 67) Cxf, J. )I., and Gray, H. J. List processiriu research techniques. Ouarterly reports l-4, For+ Monmouth, U. 5. Arq Electronics rommand, Contract No. DA 2+043-AK-02377(E), (1967). * TF 15:3s:21 08/31/72 A BIBLIOGRAPHY ON COHPUTER GRAPHICS PAGE 17. 4 Techniques

    Cheatham, 'I. 5, The theory and contruction of compiler: excerpts. Computer Associates, wakefield, Flass., 2nd edition, (1967). it LS TE Christenssn, C. An exam@? of the manipulation of directed graphs in the AMBIT/G proqramming language. MZSSS. Computing ASSOC., Div. of- Appl. Data Res. Inc., Wakefield,' Mass. (Nov 1967) . 8 TF! LS Cleary, J. G. Process handling on the Rurroughs 86500. Proc 4th Australian Computer Conference, Adelaide, South Australia, WJW, 231-239. c1 TE Cohen, D. J. A use of fast and slow memories in list - processing languages. C ACM 10, 2 (Feh 19671, 82-86. 1 TF A BIR5IOGR4PHY ON COMPUTER GPAPHTCS PAGE 17, 'i Techniques

    Cohen, D. J. Incremental nwthods for computer araphics. ?SD-TD-69-193, USAF iianscom E'ieltI, Hedford, flass., (1969). # TE

    < ct: ‘7 0 > Cohc-a, D. ‘7.. and Gotlieb, C. C. A list structure f-orm of grammars for syntactic analysis. Cmputina Surveys 2, No. 1, (Alar 1970). 44 TE

    Colby, K. ?I., Tcsler, L., and I;lned, H. Fxperiments with a search algorithm for the data base of- a human bcl ict structure. proc Tnt. Jt. Con*. nrt. Intel., Mashington, D. C.. (196% v 649-645. 4 TE

    I

    I . Coons, S. A. .C,wfaws 'or comwlter aided design ot space forms. fw:-m-41, (Jun i967). # TF CA TF

    Desens, R. 8. Computer processing for display of three-dimensional structures. 0. s. Naval Postgraduate School, AD 706 010, (1969). Y TE Dijkstra, E, W. Solution of a problem in concurrent programming control. C ACJY 8, 9 (Sep 196S), 569, U PP TF TE CS Dijkstra, E: W. Recursive programninq. - NUB. math. 2 (1960), 312-318. u TE

    Pouty, R. T., and Chai, J. W. A discipline for qcneratinq practical optimal structural designs. proc SHARE-ACM-IEEE Design Automation Workshop, (Jun 1969). fiiami. Beach, Fla., 155468. X TE CA

    15:x:21 08/M/72 A BIBLIOGRAPHY ON COMPUTER GRAPHICS PAGE 17, 8 Techniques

    Fridh, 8. C. W. An attempt. to put parts of Roberts' nWachine Perception of Three-Dimensional Solids@' into the framework of picture calculus. SLAC CG TU No. 28, (1967). w TE

    Fuller, R. n., and Bird, R. M. An associative parallel processor with application to picture processing. Proc AFIPS 1965 FJCC, vol. 27, 105-116. t AS PP T? <(;a 69a> Galimberti, P., and Montana& U. An algorithm for hidden line e%mination. C ACM 12, 4 (4pr 19691, 206-211. t TE

    Golumb, S., and Eaumert, L. Backtrack proqraaminq. J ACM 12, 4 (Ott 19651, 516-524. t TE

    +scri.ption and theorutical analysis (usinu schemnt;-lI of PLANNEi7: a lanauagc! for proving theorems and mani.uul.atin I models in a robot.. c Ph. r;. Diss~rtHion, Mssachusetts Institute of Technoloav, (Jan 1971). ALSO, (revir,ed) a.; Art if icial Intelliu~nce Wpt. 2Fi!3, PInTSac1iUsPtts Inst.it.utt? of T

    '-bare, C. A. Q. Facord handlincr. Alu01 H~l11eti.n No. 21, Duncan, F. G., @it& (adlf-.o& Enaland, (NW 1965). t TE

    t-icywood, F. E. A. cc>mpilinq techniques. Nf'w York, brnctrican Elsevier Publishing Co., Inc. 19659. d TE i

    IF7 Systems Journal 7, 3 5 4 Tfw whoh issue was devoted to computer graphics. #I TE LS

    d.) Picture lnnausqe machines. Prowedinos of a Confwence held at Australian National Univ., Cankrra, Australia, 24-28 Feb. 1969, Academic Vess, New York, (1970). 1, TF LS computer. Proc ACM 26th NatL. Conf., (1971). 376-387. # TE Kelley, K. A computer graphics proaram for the generation of halt-tone images with shadows. Coordinated Science tab., Univ. of Illinois, Tech. Rept. No. 444, (Nov 1469). ?I TE 8 Kkrer, M., an4 R--infolds, J. , (4s.) Tflterac+ive svstG?ms for experimental and applied mnthemntics. Academic Vess, (Aug 1967). 8 LS AP T?

    < KIl G&I> Knuth, ll, F. The artof computer proqrammina. ~un~amentnl Algori. thms 1, Addison-Wesley, New York. (1968).190-VW, # TF v??

    < T.rI fi 7 > tqwson, I!. k’, , Jr. FL/I list proccssica. c ACM 10, 6 (Jun 19b7) , 358-367. it TF

    i

    \./? \

    mpUt~r w~tt1ezSi.s of holoclrams for 3-D d+~pla~. c ACP 11, 10 (Oct. WW), 661-674 c t TF lFi:35:21 OW31/72 A UTl?LIOGRAPHY ON COI’WUTER GRAPHICS PAGE 17. 12 ~ Techniques

    Levin, H. FL Fet.riev;tl of ordered lists from a content aci dressed memory. RCA Rev., vol. 33, 215-229, (Jun 1962). 3 TF AS Lewis, H, F. An interactive qrnphics facility under the PDP-10 WV50 monitor and techniques for aenerating, manipulating and storafle management of type 340 display files. DECUS Proceedings, Fall 1969. x TE LS

    Lowry, E. S., and Medlock, C. W. Object code optimization. C ACM 12, 1 (Jan 1969), 13-23. i+ TE YacLaren, M. C. Macroprocvssina in ?PS. STGPLAN NMicss 4, 8 (Aug 1969), 32-36. it TE

    <&I 670 Yadnik, S. % St rina processing techniques. C ACM II), 7 IJul 19671, 420-424. 3 TE

    <'ia 6Qf> M.qtsrishitn, Y, A. A solution to the hidden line problem. Computer Science Dept., Univ. or Tllinois, Tech. Rept.. No. 335, (Jun 1969). # TE

    < M 6' 6 4 > Ywait t., J, 7% A character Comrulter tor hiqt-levc71 langunqe i:lterpretljtion. II~M Svst ,I 3, 1 (1964), W-78. t TE LS

    <3i MD nillen, J. K. CNA'nYPDIS: a LIS? program to display mathematical expressions on t-ypewritor-like devices. Interactive Svstems for Fxperimsntal Applied Yathematics, lclvin Klerw and Juris Feirlfelds, (Fds.), wm v 155-163. 0 "F

    Clj 70> Yitchell, ,7. G. Ttw design and construction of tloxitzle and efficient interactive proaramminq systems. Doctoral ?issnrtation, Carnegie-Mellon Universjty, Pittsburgh, PennsYlwni~, (Jun 1WO). # TE LS

    Pmris, R. Scatter storage techniques. c ACM 11, 1 (,lN! lwd), 38-44. t ns 7-E: AS

    FlOSf~S, J. T+c f!.lncti.on of F’UNC’IIOM j n LISE or why the FIJNAHG problem shcwl~f he called the environment problem. ?lXY Artificial Tntellicrerice Ldb., Memo. W. lq9, (1970). # SA ?'F

    Ypwmar, W.Y. Displafr prow?uros. C: ACM 10, 4, (Oct. 19711, 6~1-660. # TE PH Nievergelt, 3. Fi.xcd versu.5 self-modityinq proqrdms. Computer Journal, 8, 3 lOct lM5), 244-345. t TF PH

    i Nishihdra, !i, e+ ;31. A variant of r-esidue hashing method for associative multiple-attribute data. Kyoto Univ. Dat.a Processiry Centtx, Pept. No. A-9, (1972). 0 TE AS

    Pxslow, R. I\., PL-ous?, H. H.. and Green, R. I?., feds.) Cotqlter m;l+.cs techniques and applications. ' Flwum Press, New York, (IUWI. rt ?'E AP

    p,-\rl& j c A. 7 d n 12 Thornton, c. Symhoi'Fani$ation by threaded lists. C ACM 3, 3 (Mar 19601, WS. 8 TE

    I? billy, E. X, Jr., nrd Federighi, F. D. On revcrsiHe subroutines and c:oaputers %hat run backwards. C ACM R, 9 (sey 1965), 5S7-5S8, 578. Ir SA TE CS C?o 615~0 Wberts, L. r;. Graphical communication and cmtrol lanquages. Xr! 2nd Con

    Go 700 Homrwy, G. W. Computer .assi sted assembly and ren%zrinq of: solids. Computer I;cience Dept., Univ. of: Utah, Salt Lake City, Utah, Tech. FOpt. No. TE 4-20, (1970). rc TE

    3x33, S. Droar3mmina syst ws and languages. McGraw+!i.~.l, New York -(1967). t LS TE

    ~lvqh~rd, P. *J. f{.lirdware InaninuLat ion of three-dimensional qrnphic:S. I?Y, Advancw~ Svst. lkvelop. Div., Los Gates, Calii. # I’!? A DIHLIOGRAPHY ON C-OtiPUTER GRAPHICS PAGE 17. 16 Techniques

    :;twAish, T. 4. Pr-oarammirw ldnquaqe drsign criteria and trade-offs. Paper rxs-5, Computer c‘ctnter, Carneqie Instit.utc of technology, Pittsburgh, (Feh 1966). +I TE LS FH

    Sutherlan?, T. E. ,Perspcctivo views that change in real timt7. TJAIDE, (1969). P TE

    Tt'losas, E. ?!. ! Van Dam, A. Software $3ata paqing 3rd segmentation for complex SVH.t.mSs, Submitted t.0 TFlP '71. # TE

    V~R Dam, 4. D.tta and s+maw structlurcs tor interact.ive graphics. STGPLAN Notices 6, 2 (Feh 1971). 237-267. 8 DS TF

    UDE 57) Kin Dam, 4., WC! 5vanz, D. A compact ddtd struct,urs for storina, retrievirw bind mdnipulati na line drnwinqs. Proc AFIPS 1967 SJCC, vol. 30, (1067), 601-610. s L'S TE

    Van Raams?,onk, F. <'I. The rfipresentation of: three-dimensional oh jects aT; tics bed out stick tiyures. M. SC. Thc_tsis, University of TororAo, (1971). # TE DS eif

    /‘L tv1 1;s> Vlnhos, P. Ttx.3 three-dilrcnsional display: its cues and techni.qu63. Information Displav, (Nov/Dec 1965), 10-2c. li TE

    VNIR~L, R. A. SOIN techniques for nlqorit.hm oytimizntinn with anr,licati~>n tg matrix arithmetic expr+z+sions. Computer Science Mpar+ment, Carneaie-flellon Universitv, (&In 1968). t T-E lV'1S:?l OQ/'i1/7% 4 l?IRLlOGH4PHV ON COMPIJTFR Gf)APF!IC'; PAGF 17. 1J-I TechniquC?5

    Watkins, C,. S. A hardwart? compa tihle aluori.t.hn for cgwwratinq oisihb surfaces from 3-D data. UAIDE, (1’WJ). ii Tl?

    Wher, FT. 'A microproqrammwl implementation of EULER on IRM Syster//64 ?!o~lcl 30. C ACM 10, 9 (Sep 1967), 549~5L=,s. * I2 LS 06~ t:8b> Wwner, P. The Domolki algorithm. T? 68-18, I~epartmeat of Computer Science, Cornell University, (Hay 1968). 4 TE Wizenbaw, ,I. Hscovory ot reentrant list. structures in SLIP. C ACM 12, 7 (Jul 1959), 207. w TE hoi wnhauy J. Svrrrmet ric list wocessor. C ACM 6, 9 (Wp 1966), 524-543, t TE SA LC

    tui s9> biillinms, F. 4. [lntldlincl identitixs. 4s intPr1la.l :-qmbols in 1nngnag-t pfo~f5s0r~. C ACM 2, 6 fcfuri 1959), 21+4. 4 TF Giinston, P. H. HolC?s. -HIT, Project YAt, A. I. MCNO. 16’3. # PH TE 1') : 3 5: ;.' 1 !H/ u/72 A 31PLLOGRRPHY UN COMPUTER GPAPHTCS PAG?? 17. Techniques

    Wiwton, P. P. f.earnina structural df5xzriptions from examples. Project MAC, t?assachusetts Institute of Technoloay, Fept. No. l?nc-rR-76, (SW 1970) l * SA LS Tr;:

    Zdln, c. ‘1’. Two-dimenhonnl pattern dsscriytion and recoqnitiw via cIlrvature points. SLACRept. No. 70, (194%). ft TE <%a O> Zdn, C. T. A formal descriptim tor two-dimensional patterns. SLAC, SLAC+UW53tJ, (1969). t TE

    I--

    1 *-r : .3 s : 2 1 1)H/31/72 n HLULXOGUAT'HY ON COMPIITFR GRAPHIC? PAGE 1B. 1 Theoretical foundations 6 mathematics

    Aihims, D. A. A comput.a+ion model with data flow seyuencinq, Fspt. No. CS-117, Computer Scie!nce Department, Stanford University, (WC 1968). * TF LS (pm 71b> Yekic, H. Towards a mathematicnl theory of processes. IPY Labor.qt.orv Vit?nnn TR 25.125, (1971). t ?F

    Wrks, A. W., '&wren, D. W., and Uriqht, ‘J. R. 4n analvsis of a loclical aachine usincr pawnthesis-fief> not.ati on.. fldhematical T4hlQs and Otti*l: Aic1.s to Computatiolr, Vol. 8, No. 46, (Ipr 1354). W-57. U l'F

    Childs, D. L. F-?asihi.liCv ot a set-theoretic data structure. r>r(lc IFIP ~3T:qrc'Lc~j l?f,R, 1, N~~th-Wolland Pub. C'O., 4msterrlsm, 4200u39. +t DS TF 15: x:21 OR/31/72 A FI3LIOGRAPHY ON COMPUTER GRAPtIICS I'AGF 18. 2 Theoretical foundations 6 mathematics .

    roone, S, A. Surfacns for caaputer aided design of space forms. MAC-TP-41, (Jun 1967). 'k TE CA TF

    Denniny, P. J. Ti! 2 workina :-xt modt.4 for proaram hetiaviour. C: ACY 2, 5' (tinv 1%3-I), 323-333. tt TF

    Wnnis, J, I?., and Van Fforn, E, C. Progranmina ssmantics tor multiproqrawmed computations. (1 fiCM 9, 3 (!%nr 196G), 143-155. # SA TF CS

    Dijkstra, E, 2. Wlution of 9 problem in concurrent programming control. c: ACM 8, Y (St?p 1965), 5b9. Q PP TF TF CS

    Floyd, R. Y. NondetermiCst3.c aluooit hms. J AC!l 14, 4 (act 196ti), 636-644. # ‘I!F CS

    (“0 70) Forrest, A. F. L Interpolation and approximation by Rezier polynomial.% fJnivcrsitv of Cw?brikc, CAD Pocument, 45, (Ott 1970). tr TF TE

    Cxupu+& 3isplav ot curved surfaces. Cw pu t er 3 cience Wpt.. , Universitv of Vtah, S;ilt LakGl

    < PC1 t-J-7) Hdwrmanr!, A. N, On t.b harmonious ca-uporation of abstract machinas. noctoral ?isssrta+Aon, I'echnische Hoqeschoc)l Flindhovcn. (Ott 13671 . $ IF

    Elanhaul, ‘A., and Jonps, C. I3. The I-dock concept and souw possible implemsntations, with L proots 9f quiva13Jnr:. T-1 25.104, IW Vixnn, (Ayr 1970). # 7-F TE E-3 1'!:35: 21 (ir/31/7? A STFLIQGi?A?HY ON CCMP[JTEH GHAF'IlLCS PAGE 18. 4 Theore+ical toundations F mathematics '

    Johnson, T.- F:. Arhitxarily skappd space curves for c7 A D. MTT 1966 Cwnmcr Session Course Notes It TF TF CA

    Kleenp, S. ~~~bdo-definability nncl recursiveness. Duke ?la+hrmat ical Jo~rnitJ. 2, 1935. U TF

    Knuth, D. F. 71:~ art cf conyHer proaramminq. F'wdawntd Algorithnr:, 1, Addison-wesl+?y, F?YW York. (l~i~8).1Y)-l%. 11 1'F T?

    < I, ci 6 5 b L:lndin, F. 3. A corrf?spon?ence bet.wx!n ALGOL 60 and ~kurch% Lxni~da notaticn. c KY S, ? t; ? (Fob 5 tlar 196S). # TF

    l.?c‘, 'I. M. P, A claz3 of surfaces for computer display. Proc AFIPC 19:,9 SJCC, vol. 74. U TF TE

    Lucas, P,, Lawr, P., wk! Stiqleitner, H. Method anJ notation for the formal definition of poyramminq 1.3nqunqcs. I!??? Lnhordtory Vienna, TH 25.087, (Jrm lY68). * TF LS

    <[?a C;Q> Wnna, Z. Props t. ies of proqrams and the tirst - or&r twedicrlt.e calculus. ‘7 ACM 16, 2 (Aar 1969). * TF SA c ClcC ho> ivlccarthy, .J, !?Fcursive tunctions of symbolic expressiors and their computatic,n hv machine, Fart. I. C ACM 3, ? (Qr 1?60), W4-195. 0 TF

    McC'arthv, 127 . Towar~is a PathpUiatical sciw-ic~ of comput3ti9n. Proc TFTP Conqr0.s:; 1962, North-Eolland, (19h.3). tr TF PH

    Ycc'arthy, J. A basis fr,r a mnthnmiiticn~ theory of CoiEpIltatiOfi. C‘omputor xogrammin:r 3nA tormal systems, k praffort.antj P. HirxchberQ, (eds,), North-Holland, (3q6i.3). 1) PH TF 15:35:21 08/U/7% A 3IRLIOGRAE'HY ON COP1PlfTF:R GRAPHICS PAGF 18. 6 Theoretical foundations & mathematics

    McGowan, C., and Uegnsr, P. The equivalence of sequential and associative information structure models, Proc of Svmp. on Data Structures in Proqramsinq tnnquages, ~ainsville, Florida, SIGPLAN Notices, (PPb 1971). # AS DS TF

    Poherts, L. G. Homoqenco'ls matrix representation on n-dimensional constructs. MTT Lincoln Lab MS 1405, (May 1965). Also in Coauuter Display Review, Adams Associates, '(May 1965). it TF

    Rosenblatt, F. The perceptron, a theory of statistical separability in coanitive svstems. Rept. W-1196-6-1, Cornell Aeronautical Laboratory, Euffalo, Y. Y., (1958). X IA TF

    < Ei 0 c;. t b RWS, D. I-'. An alaorit: hmic thftor-y ot lanquaye. ESL-TM-l!%, Fkctxonic Syst. Lab., MIT, Cambridge, HifSS., (1962). t TT

    Schuarcz, P. 3. Towards a coroutationnl normalization of natural lanuuaue smardic:L PL-oc Tnt.. COI- f . on ~-':x:IF. Linq., held in Sweden, (rxy 1969) . # SA TF 1% : .3 5 : 2 1 M/71/7% PPGF: 1 rl . 7

    S!MW, A. (T., and Xilbr, W. F. A picture calculi. In Emergina Concepts in Computer Graphics. L>onjanin, ht?w York, N. Y., (lS68), 101. 0 TF TA

    < s r; 5 3 > !%ottiswood-, R., and Spottiswoode, N. ‘kc theorv of stereoscopic transmission and its 43plication +r, the motion picture. Universitv r>f Calitornia Press, Berkeley and Los I!n~4es, (1953). rt TF AN WthcSrlan~!, I. FL Anplied M,ithenn+ics 252 -Course Notes. II(irvartl Tlniwrsitv, Snring 1967. Ic TF

    Srrtherland, N. S. OUtli.IieS of a %heory of visual pattern recognition in animals ar:d man. ~roc Royal SOC. ~171, (1968), 2970.317. b IA TF

    Turinu, A. ?I. Computability nnd lamt~da-detina~,ifit.y. Journal of Syabolic Loaic, 2, 1 9 -3 7 . it TF

    <‘lu’L: ;,6> Wirth, Y., md Wber, H. E!lLEI,: a rl+qLbralizdtjon of ALGOL an? its formal tl i‘ f in i t io :1 . PiArt I* f- ACM, 9, 1 (Jan 1966), 1.3-23: P3rt 1;: C AC?I 9, 2 (Fch 1966), Q9-9r): F,rratn: :.7 ,~C!"I 0, 1,3 fDec l%f;), 078. # Y-F ?,S I

    15:35:21 05/31/72 A ~IL~LIOGR?PFIY ON COI'IPUTEB GRAPHICS PAGE 1% ThwxMical foundatiorls E mathematics

    X 0 n q , P . Constxuction heuristcs for creometry and a vector alwbra r+xemrAa+ion or qeometry. MIT Project MAC, Tech. Mmo. 28, (197i). it SA TE TV 15:3r>:21 09/H/72 A DIBLIOGRAPHY ON COMPUTER GRAPHICS PAGE 19, 1 Theorem provino

    Dnrlinqton, J. L. Theorem provers as question answerers. Unfolioed mss., Proc Tnt. Jt. Conf. Srt. Intel., &whinqton, D. C., (1969). abstract 317, it TP

    Darlinaton, J. L. Theorem provinq and information retrieval. Tn Machine Tntelliqence 4, Meitzer and Ritchie, (Rds.), Edintrurgh Univ. Press, Fdinhurqh, (1969), Ch. 11. % TP

    Green, C. C. ADplication of theorem proving to problem SdVinq. Proc 7nt. ,Jt. Conk Art. Intel., Washinqton, D. C.# (qny 19691, 219-33X # PS TP O,!

    Levoin, R. E. Felational data file: experience with a system for propositional data storage and infereme exectlti on. R&l-S947-PR, RAND Corp., Santa Monixa, Calif., (1969). W AS TP Levein, R. F,, and Naron, M. E. Wzlational data file: d tool for utechanized inference execution and data retrieval. W-4793-P& RAND Corp., Santa Monica, Calif., (Dee 19w55). t AS TP

    ib-3 68d> 3'ot4nson, J. A. ?%e present state of mechanical theorem provim. Furth System Svmposium, Cleveland, Ohio, Nov. 19-20, 1968. 8 TP

    < n\5 G7!)> ??obinr;on, J. 4. A review i,t automatic theorem provinq. ?roc of Svmnor;i.a in Auplkd P?ath, ~01. 19. AtiS, Providonc+?,'R. I., (lY67), l-l% * TP 15:35:;_?1 0 k\ / 3 1 /7 2 A PlVLIOGRAPf?Y ON COMPUTER GRAPHXCS PAGE 19. ? Theorefn proving

    < 5 ij!; 610 Scllwarcz, ?. I!., thmpr, ,I. E’. , and Simmons, H. !% A deductive logic f& mswering Enalish questions. SDC, IDec 1968), in preparation. t OA TP