|
Ivan Edward Sutherland
Ivan Edward Sutherland (born May 16, 1938) is an American computer scientist and Internet pioneer, widely regarded as a pioneer of computer graphics. His early work in computer graphics as well as his teaching with David C. Evans in that subject at the University of Utah in the 1970s was pioneering in the field. Sutherland, Evans, and their students from that era developed several foundations of modern computer graphics. He received the Turing Award from the Association for Computing Machinery in 1988 for the invention of Sketchpad, an early predecessor to the sort of graphical user interface that has become ubiquitous in personal computers. He is a member of the National Academy of Engineering, as well as the National Academy of Sciences among many other major awards. In 2012 he was awarded the Kyoto Prize in Advanced Technology for "pioneering achievements in the development of computer graphics and interactive interfaces". Biography Sutherland's father was from New Zealand; ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hastings, Nebraska
Hastings is a List of cities in Nebraska, city and the county seat of Adams County, Nebraska, Adams County, Nebraska, United States. The population was 25,152 at the 2020 United States Census, 2020 census. It is known as the town where Kool-Aid was invented by Edwin Perkins (inventor), Edwin Perkins in 1927, and celebrates that event with the Kool-Aid Days festival every August. Hastings is also known for #Fisher Fountain, Fisher Fountain, and during World War II operated the largest Naval Ammunition Depot in the United States. History Hastings was founded in 1872 at the intersection of the Burlington and Missouri River Railroad and the St. Joseph and Denver City Railroad. It was named for Colonel D. T. Hastings of the St. Joseph and Grand Island Railroad, who was instrumental in building the railroad through Adams County. The area was previously open plain: the Donner party passed through on its way to California in 1846 and a pioneer cemetery marker in Hastings bears an inscrip ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bui Tuong Phong
Bui Tuong Phong (December 14, 1942 – July 1975) was a Vietnamese-born computer graphics researcher and pioneer. He invented the widely used Phong shading algorithm and Phong reflection model. Life Phong was born in Hanoi, then French Indochina. After attending the Lycée Albert Sarraut there, he moved with his family to Saigon in 1954, where he attended the Lycée Jean Jacques Rousseau. He went to France in 1964 and was admitted to the Grenoble Institute of Technology. He received his from Grenoble in 1966 and his ''Diplôme d'Ingénieur'' from the ENSEEIHT, Toulouse, in 1968. In 1968, he joined the (then IRIA) as a researcher in Computer Science, working in the development of operating systems for digital computers. He went to the University of Utah College of Engineering in September 1971 as a research assistant in Computer Science and he received his Ph.D. from the University of Utah in 1973. Phong knew that he was terminally ill with leukemia while he was a stude ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Association For Computing Machinery
The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membership group, claiming nearly 110,000 student and professional members . Its headquarters are in New York City. The ACM is an umbrella organization for academic and scholarly interests in computer science ( informatics). Its motto is "Advancing Computing as a Science & Profession". History In 1947, a notice was sent to various people: On January 10, 1947, at the Symposium on Large-Scale Digital Calculating Machinery at the Harvard computation Laboratory, Professor Samuel H. Caldwell of Massachusetts Institute of Technology spoke of the need for an association of those interested in computing machinery, and of the need for communication between them. ..After making some inquiries during May and June, we believe there is ample interest to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IEEE John Von Neumann Medal
The IEEE John von Neumann Medal was established by the IEEE Board of Directors in 1990 and may be presented annually "for outstanding achievements in computer-related science and technology." The achievements may be theoretical, technological, or entrepreneurial, and need not have been made immediately prior to the date of the award. The medal is named after John von Neumann. Recipients The following people have received the IEEE John von Neumann Medal: See also * List of computer science awards * John von Neumann Theory Prize awarded by the Institute for Operations Research and the Management Sciences (INFORMS). * Prizes named after people References Computer science awards John von Neumann Medal The IEEE John von Neumann Medal was established by the IEEE Board of Directors in 1990 and may be presented annually "for outstanding achievements in computer-related science and technology." The achievements may be theoretical, technological, or ... Awards established ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Pioneer Award
The Computer Pioneer Award was established in 1981 by the Board of Governors of the IEEE Computer Society to recognize and honor the vision of those people whose efforts resulted in the creation and continued vitality of the computer industry. The award is presented to outstanding individuals whose main contribution to the concepts and development of the computer field was made at least fifteen years earlier. The recognition is engraved on a silver medal specially struck for the Society. This award has now been renamed to "Women of the ENIAC Computer Pioneer Award". Award types The award has two types of recipients: * Computer Pioneer Charter Recipients - At the inauguration of this award, the individuals who already meet the Computer Pioneer Award criteria and also have received IEEE Computer Society awards prior to 1981. * Computer Pioneer Recipients - Awarded annually since 1981. Computer Pioneer Charter Recipients * Howard H. Aiken - Large-Scale Automatic Computation * Sam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Turing Award
The ACM A. M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) for contributions of lasting and major technical importance to computer science. It is generally recognized as the highest distinction in computer science and is colloquially known as or often referred to as the " Nobel Prize of Computing". The award is named after Alan Turing, who was a British mathematician and reader in mathematics at the University of Manchester. Turing is often credited as being the key founder of theoretical computer science and artificial intelligence. From 2007 to 2013, the award was accompanied by an additional prize of US$250,000, with financial support provided by Intel and Google. Since 2014, the award has been accompanied by a prize of US$1 million, with financial support provided by Google. The first recipient, in 1966, was Alan Perlis, of Carnegie Mellon University. The first female recipient was Frances E. Allen of IBM in 2006. The latest reci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sutherland–Hodgman Algorithm
The Sutherland–Hodgman algorithm is an algorithm used for clipping polygons. It works by extending each line of the convex ''clip polygon'' in turn and selecting only vertices from the ''subject polygon'' that are on the visible side. Description The algorithm begins with an input list of all vertices in the subject polygon. Next, one side of the clip polygon is extended infinitely in both directions, and the path of the subject polygon is traversed. Vertices from the input list are inserted into an output list if they lie on the visible side of the extended clip polygon line, and new vertices are added to the output list where the subject polygon path crosses the extended clip polygon line. This process is repeated iteratively for each clip polygon side, using the output list from one stage as the input list for the next. Once all sides of the clip polygon have been processed, the final generated list of vertices defines a new single polygon that is entirely visible. Note tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cohen–Sutherland Algorithm
In computer graphics, the Cohen–Sutherland algorithm is an algorithm used for line clipping. The algorithm divides a two-dimensional space into 9 regions and then efficiently determines the lines and portions of lines that are visible in the central region of interest (the viewport). The algorithm was developed in 1967 during flight simulator work by Danny Cohen and Ivan Sutherland.''Principles of Interactive Computer Graphics'', p. 124, 252, by Bob Sproull and William M. Newman, 1973, McGraw–Hill Education, International edition, . The algorithm The algorithm includes, excludes or partially includes the line based on whether: * Both endpoints are in the viewport region (bitwise OR of endpoints = 0000): trivial accept. * Both endpoints share at least one non-visible region, which implies that the line does not cross the visible region. (bitwise AND of endpoints ≠ 0000): trivial reject. * Both endpoints are in different regions: in case of this nontrivial situation the al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zooming User Interface
In computing, a zooming user interface or zoomable user interface (ZUI, pronounced zoo-ee) is a graphical environment where users can change the scale of the viewed area in order to see more detail or less, and browse through different documents. A ZUI is a type of graphical user interface (GUI). Information elements appear directly on an infinite virtual desktop (usually created using vector graphics), instead of in windows. Users can pan across the virtual surface in two dimensions and zoom into objects of interest. For example, as you zoom into a text object it may be represented as a small dot, then a thumbnail of a page of text, then a full-sized page and finally a magnified view of the page. ZUIs use zooming as the main metaphor for browsing through hyperlinked or multivariate information. Objects present inside a zoomed page can in turn be zoomed themselves to reveal further detail, allowing for recursive nesting and an arbitrary level of zoom. When the level of det ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sketchpad
Sketchpad (a.k.a. Robot Draftsman) is a computer program written by Ivan Sutherland in 1963 in the course of his PhD thesis, for which he received the Turing Award in 1988, and the Kyoto Prize in 2012. It pioneered human–computer interaction (HCI), and is considered the ancestor of modern computer-aided design (CAD) programs as well as a major breakthrough in the development of computer graphics in general. For example, the graphical user interface (GUI) was derived from Sketchpad as well as modern object-oriented programming. Using the program, Ivan Sutherland showed that computer graphics could be used for both artistic and technical purposes in addition to demonstrating a novel method of human–computer interaction. History Sutherland was inspired by the Memex from "As We May Think" by Vannevar Bush. Sketchpad inspired Douglas Engelbart to design and develop oN-Line System at the Augmentation Research Center (ARC) at the Stanford Research Institute (SRI) during the 1960s. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Interactive Computing
In computer science, interactive computing refers to software which accepts input from the user as it runs. Interactive software includes commonly used programs, such as word processors or spreadsheet applications. By comparison, non-interactive programs operate without user intervention; examples of these include compilers and batch processing applications that are pre-programmed to run independently. Interactive computing focuses on real-time interaction ("dialog") between the computer and the operator, and the technologies that enable them. If the response of the computer system is complex enough, it is said that the system is conducting social interaction; some systems try to achieve this through the implementation of social interfaces. The nature of interactive computing as well as its impact on users, are studied extensively in the field of computer interaction. History of interactive computing systems Ivan Sutherland is considered the father of interactive computin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Direct Linear Transformation
Direct linear transformation (DLT) is an algorithm which solves a set of variables from a set of similarity relations: : \mathbf_ \propto \mathbf \, \mathbf_ for \, k = 1, \ldots, N where \mathbf_ and \mathbf_ are known vectors, \, \propto denotes equality up to an unknown scalar multiplication, and \mathbf is a matrix (or linear transformation) which contains the unknowns to be solved. This type of relation appears frequently in projective geometry. Practical examples include the relation between 3D points in a scene and their projection onto the image plane of a pinhole camera, and homographies. Introduction An ordinary system of linear equations : \mathbf_ = \mathbf \, \mathbf_ for \, k = 1, \ldots, N can be solved, for example, by rewriting it as a matrix equation \mathbf = \mathbf \, \mathbf where matrices \mathbf and \mathbf contain the vectors \mathbf_ and \mathbf_ in their respective columns. Given that there exists a unique ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Turing Award")
