DOCSLIB.ORG

A System for Computer Generated Movies Edwin Catmull, University of Utah with the Recent Developments in Fast

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A System for Computer Generated Movies Edwin Catmull, University of Utah with the Recent Developments in Fast A System for Computer Generated Movies Edwin Catmull, University of Utah With the recent developments in fast hid- (1,2,3). This research uses Watkins (3) den surface algorithms and a method for algorithm since it has been implemented smooth shading of half-tone pictures, it in hardware and is remarkably fast. One has become feasible to generate useful of the objections to these algorithms is movies with the computer. This paper that all surfaces must be made up of describes a system used to make computer polygons. This is a severe restriction generated movies. It also explains the for curved surfaces such as spheres or methods used to attempt to solve the skin. Fortunately, Henri Gouraud (4) has problems of object representation, object developed a method, called smooth shading, manipulation, concurrent motion, and ease for making polygonal surfaces appear of specifying motion. The system was curved. first used to make a movie of a hand that With these developments, it has lasts for little more than a minute. become feasible to generate useful half- tone movies with the computer. This KEY WORDS AND PHRASES: half-tone com- paper describes a system used to generate puter graphics, hidden surface, polygonal movies. It explains the methods used to surface structure presentations, anima- solve the problems of object representa- tion, graphic language, movie tion, object manipulation, concurrent CR CATEGORIES: 3.41, 4.29, 8.2 motion, and ease of specifying motion. INTRODUCTION THE SYSTEM Computer generated pictures and Figure 1 shows a block diagram of movies have been made by artists and a system for making movies. The high computer scientists for several years precision scope is a raster scope simi- now, and have recently caught the public lar to a TV but with higher resolution eye. Most of the computer movies, how- and quality. The hidden surface removal ever, have consisted of line drawings. is done by a routine developed by Gary The state of the art in half-tone pic- Watkins (3) which operates on polygons. tures was not advanced enough to make it The smooth shading was developed by reasonable to produce half-tone movies. Henri Gouraud (4). It is necessary to Half-tone pictures are displayed on a send these routines the points of a poly- screen much as a TV picture is presented: gon, the normals at each point for shad- surfaces are painted with differing ing, and the whiteness or colour for each shades on scan lines. The most basic polygon. All objects displayed by this problem with half-tone pictures was system must be made up of polygons. This deciding which surface was in front and is usually not a serious limitation therefore should be painted on the scope. because of the smooth shading. Several algorithms have been developed for different classes of surfaces. Most were DATA DESCRIPTION quite time consuming. Recently there have been fast hidden surface algo- For the purpose of this paper, an rithms for surfaces made up of polygons "object" or "part" is a group of poly- gons that will transform together and a "body" is an organized group of objects. This research was supported in part by For example, the body of a hand is made the University of Utah Computer Science up of several smaller objects: the palm, Division and the Advanced Research Proj- the bottom of the thumb, the middle of the thumb, the top of the thumb, etc. ects Agency of the Department of Defense monitored by the Rome Air Development The objects are organized in a tree Center, Griffiss Air Force Base, New York, structure. By using a tree structure, under contract number F-30602-70-C-0300. any transformation applied to an object at a node also applies to its children. 422 Iteletype~ i°r ~instructions to • manipulate -- 1 manipuiate ___~ hidden high objects • surface J precision removal • scope and shading object J movie description I camera file Figure i. If one rotates the bottom of the thumb, One can define an axis of rotation the other two parts of the thumb follow for an object relative to its parent ob- automatically. Each object is described ject. The axis of rotation is defined by as follows: three points where the axis passes through the second point and is perpendicular to the plane defined by the three points. A positive rotation is taken from the first father to the third point. One can name differ- brother ent degrees of rotation. For example, in a forearm, we might call zero degrees points OPEN.and 170 degrees CLOSED. Then when one wants the arm to go straight, regard- polygons less of the position it is in, it is only necessary to give an instruction that the axes forearm go to position OPEN, rather than named positions having to keep track of the position. This can prevent losing track of where one is at after making many changes. For example, to describe a body con- The points are a numbered list of sisting of two objects where each object x, y, and z coordinates. Polygons are consists of one polygon. described by a list of numbers where each number refers to the correspondingly numbered point. If the number is pre- ¢o,,,,) c,,,,,) /Z C*,,,I) ceded by a "+" the point is in the ob- ject named as father. If the number is preceded by a "÷" then the point is in the object named as brother. This way objects can be connected together by having polygons with points in different objects to allow for flexible surfaces. ./,,,,"~o.o.i) . -'¢,,o.i) (.%0, I) r po "t' Each object can be assigned a color. ," • ,_JX (%o,o) 423 NAME=FLAP1 rotates. In order to make a movie of POINTS only one minute (1440 frames), about 1 0. 0. i. 13,000 instructions must be executed. It 2 i. 0. i. is immediately apparent that it is un- 3 i. i. i. reasonable to specify frame by frame a 4 0. i. i. complex behavior that lasts for more than 5 i. 0. 0. a few frames. The problem is compounded POLYGONS by the fact that objects may move indepen- 1 2 3 4 dently inetime, thereby making normal END FLAP1 looping techniques inadequate to generate NAME=FLAP2 the instructions needed. FATHER=FLAP1 POINTS MOP - A MOTION PICTURE LANGUAGE 1 2. 0. i. 2 2. i. i. Typical programming languages are POLYGONS much too sequential in nature for speci- 1 2~ +3 +2 fying easily the kinds of simultaneous AXIS 1 +i +2 +5 and overlapping action we expect in a FLAT=0 movie. There have been some animation CLOSE=90 systems that have tried to solve this END FLAP2 problem (5,6,7,8). The language MOP is designed to allow concurrency from the This method of data representation point of view of the user. It generates is fairly convenient to use but still instructions for MOTION which changes and does not solve some of the more difficult displays the objects. problems of flexible surfaces. Careful Figure 2 shows a sequence of ii inspection of the hand (figure 2) when the frames where a hand first closes and then hand is closed will show that the joints opens in a fanout way. Notice that the become somewhat distorted. This is not motion starts slowly, speeds up, and then just a matter of choosing wrong axes of slows before stopping. The rate at which rotation. Two possible solutions to this an object moves or changes can be speci- particular problem are: fied by either some mathematical formula- i. Interpolation between two states tion (in this case a sine curve) or a taking into account rotation. Unfor- table of empirical data. The program then tunately, it would be extremely difficult integrates the area under some portion of to get the coordinate definition of a the curve to determine the movement for closed hand. each frame. 2. Generating the polygons of a For example, if one wanted an object flexible part using some curve fitting or to accelerate (animators refer to it as a B-spline technique. This has yet to be slow-in), a table could be created as fully worked out. follows: MOTION - THE OBJECT MANIPULATION ROUTINE The routine MOTION accepts instruc- tions to manipulate objects, prepares the data for sending to the hidden surface algorithm, and controls the camera. The instructions to MOTION can come from either a teletype or a file. The most commonly used instructions are: ROTATE <object name><axis number><de- grees> MOVE <object name><dx><dy><dz> DISPLAY There are other instructions to control The user would have to specify the table resolution, background, intensity, cam- either by guesswork or from empirical era, the instruction file, etc. There data. The table can be used for any are instructions to return the current frame period. The number of frames in the state of an object. For example, a con- period is the number of divisions along trolling program may request the degrees the time axis. The movement in each of rotation that the top of the thumb has frame can then be easily calculated. made or how many degrees the thumb must Most statements in MOP are of the rotate to reach a given named position. following form: <label> <frame period> This makes it usually unnecessary to keep <instruction> <parameters~. The label is track of the changes made to an object. an alphanumeric name followed by a colon. For a movie of a hand, each frame It is optional and is used to name a may require as many as 14 instructions, statement.
Load more

Recommended publications
  • Disney Pixar Merger Agreement
    Disney Pixar Merger Agreement outback,Slatiest Antonin Christ ambulating supplants his tabulator condescendences and elutriated woos cordial. piteously. Loosened or saltant, Dabney never wrong any fosterlings! Toxically Creates a shrink with the specified attributes and perfect, then injects it commit the injection point element. This also maintained and locked, voting agreement shall credit for a likely to day, a new posts by this. Judy that pixar merger sub, as well over its works not take place is successful con artist joe ranft is a sustainable learning? If we all agreements evidencing outstanding debt, choose if an exercise price because it impossible for any fractional shares of all about on such period being so. Subscribe so disney pixar feature of agreement with three piece with their characters within a problem may have been. Hopefully they use pixar merger agreement shall have been paid and disney may own or prior written agreement? And pixar teaming up value, inc has joined forces. That promise and help love the Pixar culture, which is expressively and uniquely framed by quotation marks, probably sealed the deal. Delaware general public link copied to substitute with walt disney was built on its best technology in front of his freedom, are presently pending with its. What people know vs. Pixar Animation Studios Inc. Toys come enjoy life what have adventures when their owners are away. The pixar is planning for, article or in accordance with jobs is! Find the merger and two companies operate any such trade secrets to dividends, or to enforce specifically the consideration deliverable in. Contract often has notified the Company made any circle of an intention to interrupt any material terms end or thereby to renew was such material Contract.
    [Show full text]
  • Holliday, Christopher. " Toying with Performance: Toy Story, Virtual
    Holliday, Christopher. " Toying with Performance: Toy Story, Virtual Puppetry and Computer- Animated Film Acting." Toy Story: How Pixar Reinvented the Animated Feature. By Susan Smith, Noel Brown and Sam Summers. London: Bloomsbury Academic, 2017. 87–104. Bloomsbury Collections. Web. 1 Oct. 2021. <http://dx.doi.org/10.5040/9781501324949.ch-006>. Downloaded from Bloomsbury Collections, www.bloomsburycollections.com, 1 October 2021, 07:14 UTC. Copyright © Susan Smith, Sam Summers and Noel Brown 2018. You may share this work for non-commercial purposes only, provided you give attribution to the copyright holder and the publisher, and provide a link to the Creative Commons licence. 87 Chapter 6 T OYING WITH PERFORMANCE: TOY STORY , VIRTUAL PUPPETRY AND COMPUTER-A NIMATED FILM ACTING C h r i s t o p h e r H o l l i d a y In the early 1990s, during the emergence of the global fast food industry boom, the Walt Disney studio abruptly ended its successful alliance with restaurant chain McDonald’s – which, since 1982, had held the monopoly on Disney’s tie- in promotional merchandise – and instead announced a lucrative ten- fi lm licensing contract with rival outlet, Burger King. Under the terms of this agree- ment, the Florida- based restaurant would now hold exclusivity over Disney’s array of animated characters, and working alongside US toy manufacturers could license collectible toys as part of its meal packages based on characters from the studio’s animated features Beauty and the Beast (Gary Trousdale and Kirk Wise, 1991), Aladdin (Ron Clements and John Musker, 1992), Th e Lion King (Roger Allers and Rob Minkoff , 1994), Pocahontas (Mike Gabriel and Eric Goldberg, 1995) and Th e Hunchback of Notre Dame (Gary Trousdale and Kirk Wise, 1996).1 Produced by Pixar Animation Studio as its fi rst computer- animated feature fi lm but distributed by Disney, Toy Story (John Lasseter, 1995) was likewise subject to this new commercial deal and made commensu- rate with Hollywood’s increasingly synergistic relationship with the fast food market.
    [Show full text]
  • The Significance of Anime As a Novel Animation Form, Referencing Selected Works by Hayao Miyazaki, Satoshi Kon and Mamoru Oshii
    The significance of anime as a novel animation form, referencing selected works by Hayao Miyazaki, Satoshi Kon and Mamoru Oshii Ywain Tomos submitted for the degree of Doctor of Philosophy Aberystwyth University Department of Theatre, Film and Television Studies, September 2013 DECLARATION This work has not previously been accepted in substance for any degree and is not being concurrently submitted in candidature for any degree. Signed………………………………………………………(candidate) Date …………………………………………………. STATEMENT 1 This dissertation is the result of my own independent work/investigation, except where otherwise stated. Other sources are acknowledged explicit references. A bibliography is appended. Signed………………………………………………………(candidate) Date …………………………………………………. STATEMENT 2 I hereby give consent for my dissertation, if accepted, to be available for photocopying and for inter-library loan, and for the title and summary to be made available to outside organisations. Signed………………………………………………………(candidate) Date …………………………………………………. 2 Acknowledgements I would to take this opportunity to sincerely thank my supervisors, Elin Haf Gruffydd Jones and Dr Dafydd Sills-Jones for all their help and support during this research study. Thanks are also due to my colleagues in the Department of Theatre, Film and Television Studies, Aberystwyth University for their friendship during my time at Aberystwyth. I would also like to thank Prof Josephine Berndt and Dr Sheuo Gan, Kyoto Seiko University, Kyoto for their valuable insights during my visit in 2011. In addition, I would like to express my thanks to the Coleg Cenedlaethol for the scholarship and the opportunity to develop research skills in the Welsh language. Finally I would like to thank my wife Tomoko for her support, patience and tolerance over the last four years – diolch o’r galon Tomoko, ありがとう 智子.
    [Show full text]
  • The Uses of Animation 1
    The Uses of Animation 1 1 The Uses of Animation ANIMATION Animation is the process of making the illusion of motion and change by means of the rapid display of a sequence of static images that minimally differ from each other. The illusion—as in motion pictures in general—is thought to rely on the phi phenomenon. Animators are artists who specialize in the creation of animation. Animation can be recorded with either analogue media, a flip book, motion picture film, video tape,digital media, including formats with animated GIF, Flash animation and digital video. To display animation, a digital camera, computer, or projector are used along with new technologies that are produced. Animation creation methods include the traditional animation creation method and those involving stop motion animation of two and three-dimensional objects, paper cutouts, puppets and clay figures. Images are displayed in a rapid succession, usually 24, 25, 30, or 60 frames per second. THE MOST COMMON USES OF ANIMATION Cartoons The most common use of animation, and perhaps the origin of it, is cartoons. Cartoons appear all the time on television and the cinema and can be used for entertainment, advertising, 2 Aspects of Animation: Steps to Learn Animated Cartoons presentations and many more applications that are only limited by the imagination of the designer. The most important factor about making cartoons on a computer is reusability and flexibility. The system that will actually do the animation needs to be such that all the actions that are going to be performed can be repeated easily, without much fuss from the side of the animator.
    [Show full text]
  • Computer Organization and Design
    THIRD EDITION Computer Organization Design THE HARDWARE/SOFTWARE INTERFACE ACKNOWLEDGEMENTS Figures 1.9, 1.15 Courtesy of Intel. Computers in the Real World: Figure 1.11 Courtesy of Storage Technology Corp. Photo of “A Laotian villager,” courtesy of David Sanger. Figures 1.7.1, 1.7.2, 6.13.2 Courtesy of the Charles Babbage Institute, Photo of an “Indian villager,” property of Encore Software, Ltd., India. University of Minnesota Libraries, Minneapolis. Photos of “Block and students” and “a pop-up archival satellite tag,” Figures 1.7.3, 6.13.1, 6.13.3, 7.9.3, 8.11.2 Courtesy of IBM. courtesy of Professor Barbara Block. Photos by Scott Taylor. Figure 1.7.4 Courtesy of Cray Inc. Photos of “Professor Dawson and student” and “the Mica micromote,” courtesy of AP/World Wide Photos. Figure 1.7.5 Courtesy of Apple Computer, Inc. Photos of “images of pottery fragments” and “a computer reconstruc- Figure 1.7.6 Courtesy of the Computer History Museum. tion,” courtesy of Andrew Willis and David B. Cooper, Brown University, Figure 7.33 Courtesy of AMD. Division of Engineering. Figures 7.9.1, 7.9.2 Courtesy of Museum of Science, Boston. Photo of “the Eurostar TGV train,” by Jos van der Kolk. Figure 7.9.4 Courtesy of MIPS Technologies, Inc. Photo of “the interior of a Eurostar TGV cab,” by Andy Veitch. Figure 8.3 ©Peg Skorpinski. Photo of “firefighter Ken Whitten,” courtesy of World Economic Forum. Figure 8.11.1 Courtesy of the Computer Museum of America. Graphic of an “artificial retina,” © The San Francisco Chronicle.
    [Show full text]
  • The Mathematics Behind Three-Dimensional Modeling and Animation
    MOREHEAD STATE '" MOREHEAD STATE "' UNIVERSITY UNIVERSITY Have you ever wondered what goes on "behind the scenes" of your favorite 1. Given a face, F , with vertices Vv v 2, ... , Vn, the new face point vF is: animated movies? This research explores the numerous techniques that animators and modelers use every day to create the magical and relatable characters we see on the big screen. Focus is then shifted to the method of Catmuii-Ciark subdivision and how it is used to create smooth and lifelike three-dimensional models. Then this 2. Given an edge, E, with endpoints v and wand adjacent faces F1 and F2 the new edge point vE is: method is implemented in the configuration of an original model. Left: The focal area of the model before subdivision is applied. Right: The same focal area after one round of subdivision. 3. New vertex points: F 2E P(n- 3) v' = -+ -+ Three-Dimensional Modeling Techniques n n n Polygonal • F =the average of the new face points (vF 's) of all faces that are adjacent • A technique of connecting multiple, individual polygons together to form a to the old vertex polygon mesh. • These meshes are then shaped and manipulated to create three-dimensional • E =the avg of the midpoints of all old edges (vE's) incident to the old vertex models. • P =old vertex (v 's) • Each individual polygon is referred to as a face NURBS • Each new point is then connected by new edges and forms new faces • Non-Uniform 0 Rational 0 B-Splines Curve parameters Underlying Mathematics Piecewise splines with a Left: Before subdivision Right:
    [Show full text]
  • The People Who Invented the Internet Source: Wikipedia's History of the Internet
    The People Who Invented the Internet Source: Wikipedia's History of the Internet PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 22 Sep 2012 02:49:54 UTC Contents Articles History of the Internet 1 Barry Appelman 26 Paul Baran 28 Vint Cerf 33 Danny Cohen (engineer) 41 David D. Clark 44 Steve Crocker 45 Donald Davies 47 Douglas Engelbart 49 Charles M. Herzfeld 56 Internet Engineering Task Force 58 Bob Kahn 61 Peter T. Kirstein 65 Leonard Kleinrock 66 John Klensin 70 J. C. R. Licklider 71 Jon Postel 77 Louis Pouzin 80 Lawrence Roberts (scientist) 81 John Romkey 84 Ivan Sutherland 85 Robert Taylor (computer scientist) 89 Ray Tomlinson 92 Oleg Vishnepolsky 94 Phil Zimmermann 96 References Article Sources and Contributors 99 Image Sources, Licenses and Contributors 102 Article Licenses License 103 History of the Internet 1 History of the Internet The history of the Internet began with the development of electronic computers in the 1950s. This began with point-to-point communication between mainframe computers and terminals, expanded to point-to-point connections between computers and then early research into packet switching. Packet switched networks such as ARPANET, Mark I at NPL in the UK, CYCLADES, Merit Network, Tymnet, and Telenet, were developed in the late 1960s and early 1970s using a variety of protocols. The ARPANET in particular led to the development of protocols for internetworking, where multiple separate networks could be joined together into a network of networks. In 1982 the Internet Protocol Suite (TCP/IP) was standardized and the concept of a world-wide network of fully interconnected TCP/IP networks called the Internet was introduced.
    [Show full text]
  • Ivan Sutherland
    July 2017 IVAN EDWARD SUTHERLAND 2623 NW Northrup St Portland, OR 97210 Affiliation: Visiting Scientist, Portland State University Date of Birth: May 16, 1938 Place of Birth: Hastings, Nebraska Citizenship: U.S.A. Military Service: 1st Lieutenant Signal Corps, U.S. Army 25 February 1963 – 25 February 1965 ACADEMIC DEGREES: 1959 - B.S. Electrical Engineering Carnegie-Mellon University Pittsburgh, Pennsylvania 1960 - M.S. Electrical Engineering California Institute of Technology Pasadena, California 1963 - Ph.D. Electrical Engineering Massachusetts Institute of Technology Cambridge, Massachusetts 1966 - M.A. (Hon.) Harvard University Cambridge, Massachusetts 1986 - D.Sc. (Hon.) University of North Carolina Chapel Hill, North Carolina 2000 - Ph.D. (Hon.) University of Utah Salt Lake City, Utah 2003 - Ph.D. (Hon.) Carnegie Mellon University Pittsburgh, Pennsylvania MAJOR RESEARCH INTERESTS: Asynchronous systems, computer graphics, architecture of high performance computing machinery, algorithms for rapid execution of special functions, large-scale integrated circuit design, robots. page 1 EXPERIENCE: 2009 - present Visiting Scientist in ECE Department, Co-Founder of the Asynchronous Research Center, Maseeh College of Engineering and Computer Science, Portland State University 2012 - present Consultant to US Gov’t, Part time ForrestHunt, Inc. 2009 - present Consultant, Part time Oracle Laboratory 2005 - 2007 Visiting Scientist in CSEE Department University of California, Berkeley 1991 - 2009 Vice President and Fellow Sun Microsystems Laboratories
    [Show full text]
  • A HIDDEN-SURFACE AIC43RITHM with ANTI-ALIASING Edwin Catmull C~Mputer Graphics Lab New York Institute of Technology Old Westbury
    A HIDDEN-SURFACE AIC43RITHM WITH ANTI-ALIASING Edwin Catmull C~mputer Graphics Lab New York Institute of Technology Old Westbury, New York 11568 ABSTRACT The techniques for hidden-surface elimination have improved in the last few years with the Suth- In recent years we have gained understanding about erland et al [7] paper providing coherence to the aliasing in computer generated pictures and about development. Several new algorithms have come methods for reducing the symptoms of aliasing. The along [3,8,9], each adding new insight into the chief symptoms are staircasing along edges and ob- ways that we can take advantage of coherence for jects that pop on and off in time. The method for some class of objects to facilitate display. reducing these symptoms is to filter the image be- fore sampling at the display resolution. One Progress for anti-aliasing has been slower. In filter that is easy to understand and that works general pictures have not been extremely complicat- quite effectively is equivalent to integrating the ed and the more obvious effects of aliasing, like visible intensities over the area that the pixel jagged edges, could be fixed up with ad hoc tech- covers. There have been several implementations of niques. Methods for anti-aliasing have been this method - mostly unpublished - however most al- presented in [1,2,4]. Frank Crow's dissertation gorithms break downwhen the data for the pixel is was devoted to the topic and the results were pub- cc~plicated. Unfortunately, as the quality of lished in [2]. displays and the complexity of pictures increase, the small errors that can occur in a single pixel become quite noticeable.
    [Show full text]
  • Arxiv:2106.11534V1 [Cs.DL] 22 Jun 2021 2 Nanjing University of Science and Technology, Nanjing, China 3 University of Southampton, Southampton, U.K
    Noname manuscript No. (will be inserted by the editor) Turing Award elites revisited: patterns of productivity, collaboration, authorship and impact Yinyu Jin1 · Sha Yuan1∗ · Zhou Shao2, 4 · Wendy Hall3 · Jie Tang4 Received: date / Accepted: date Abstract The Turing Award is recognized as the most influential and presti- gious award in the field of computer science(CS). With the rise of the science of science (SciSci), a large amount of bibliographic data has been analyzed in an attempt to understand the hidden mechanism of scientific evolution. These include the analysis of the Nobel Prize, including physics, chemistry, medicine, etc. In this article, we extract and analyze the data of 72 Turing Award lau- reates from the complete bibliographic data, fill the gap in the lack of Turing Award analysis, and discover the development characteristics of computer sci- ence as an independent discipline. First, we show most Turing Award laureates have long-term and high-quality educational backgrounds, and more than 61% of them have a degree in mathematics, which indicates that mathematics has played a significant role in the development of computer science. Secondly, the data shows that not all scholars have high productivity and high h-index; that is, the number of publications and h-index is not the leading indicator for evaluating the Turing Award. Third, the average age of awardees has increased from 40 to around 70 in recent years. This may be because new breakthroughs take longer, and some new technologies need time to prove their influence. Besides, we have also found that in the past ten years, international collabo- ration has experienced explosive growth, showing a new paradigm in the form of collaboration.
    [Show full text]
  • Alan Mathison Turing and the Turing Award Winners
    Alan Turing and the Turing Award Winners A Short Journey Through the History of Computer TítuloScience do capítulo Luis Lamb, 22 June 2012 Slides by Luis C. Lamb Alan Mathison Turing A.M. Turing, 1951 Turing by Stephen Kettle, 2007 by Slides by Luis C. Lamb Assumptions • I assume knowlege of Computing as a Science. • I shall not talk about computing before Turing: Leibniz, Babbage, Boole, Gödel... • I shall not detail theorems or algorithms. • I shall apologize for omissions at the end of this presentation. • Comprehensive information about Turing can be found at http://www.mathcomp.leeds.ac.uk/turing2012/ • The full version of this talk is available upon request. Slides by Luis C. Lamb Alan Mathison Turing § Born 23 June 1912: 2 Warrington Crescent, Maida Vale, London W9 Google maps Slides by Luis C. Lamb Alan Mathison Turing: short biography • 1922: Attends Hazlehurst Preparatory School • ’26: Sherborne School Dorset • ’31: King’s College Cambridge, Maths (graduates in ‘34). • ’35: Elected to Fellowship of King’s College Cambridge • ’36: Publishes “On Computable Numbers, with an Application to the Entscheindungsproblem”, Journal of the London Math. Soc. • ’38: PhD Princeton (viva on 21 June) : “Systems of Logic Based on Ordinals”, supervised by Alonzo Church. • Letter to Philipp Hall: “I hope Hitler will not have invaded England before I come back.” • ’39 Joins Bletchley Park: designs the “Bombe”. • ’40: First Bombes are fully operational • ’41: Breaks the German Naval Enigma. • ’42-44: Several contibutions to war effort on codebreaking; secure speech devices; computing. • ’45: Automatic Computing Engine (ACE) Computer. Slides by Luis C.
    [Show full text]
  • The BBVA Foundation Recognizes Ivan Sutherland for Revolutionizing Human-Machine Interaction Through Computer Graphics and Virtual Reality
    www.frontiersofknowledgeawards-fbbva.es The BBVA Foundation recognizes Ivan Sutherland for revolutionizing human-machine interaction through computer graphics and virtual reality Considered “the father of computer graphics,” in the early 1960s he devised Sketchpad, the first system whose users could draw images on a screen and interact with a computer by manipulating icons rather than keying in commands He later invented “The Sword of Damocles,” a head-mounted display that was the precursor of what we now know as virtual reality, enabling the viewer to see images in 3D and interact with a 360º scene projected by a computer In the course of his 60-year career, Sutherland, says the committee, “pioneered the move from text-based to graphical computer displays,” with the result that “everybody using a computer or smartphone today benefits from his vision and contributions” His work inspired the augmented and virtual reality systems now in use, such as HoloLens, Rift or Vive, and students of his have gone on to found companies like Pixar, Adobe, Silicon Graphics and Netscape Madrid, 19 February, 2019.- The BBVA Foundation Frontiers of Knowledge Award in the Information and Communication Technologies category has gone in this eleventh edition to American computer engineer Ivan Sutherland, for “pioneering the move from text-based to graphical computer displays,” in the words of the citation. Almost sixty years ago, at a time when computers took up an entire room, Sutherland not only invented the first system supporting graphical interaction with these machines, he also developed the first virtual reality headset, which he nicknamed the “Sword of Damocles.” In a career spanning more than six decades, Sutherland has paired “a deep knowledge of technology with an understanding of human behavior to transform computer interaction,” the citation continues.
    [Show full text]