The user of an interactive application is in an anamolous position, especially if he is not one of the elite class known as "computer bums". This mythical user is at the end of a process totally controlled by a computer and a program. His communications with the program may suffer greatly because of this total dependence.Control of communication in the batch environment is much more a one-way street. Here the user supplies the program data, and the batch program informs him if something has gone wrong by evicting his run from the machine. The user then consults available documentation (if it exists) or a computer expert (if one exists) for help in solving the problem. The communication between program and user is not critical in this environment; the user is expected to know what to do before he starts the run and can seek assistance outside of the computer.The interactive environment, however, has the user totally at the mercy of the program for diagnostic and prompting information. Even sophisticated graphics-oriented applications, which provide large amounts of useful information through pictures, may not adequately control the user's interaction. The user needs direction imposed on him to successfully solve his problem. At the same time, the system must provide flexibility, i.e., he must not be constrained to a single path of action that may only suit the code's implementor. No user's manual can capture a flow of this nature because of the inherently static nature of words on paper. Furthermore, paging back and forth in a manual to decipher what is to be done next destroys the spontaneity implicit in a successful interactive system.The user must be the main concern of the interactive system for it to be successful. With this goal in mind, Battelle-Columbus has developed a structured approach to controlling user interaction. The approach benefits the implementor as well as the user. It places emphasis on design and checkout of interaction as the first, rather than the last, step in an interactive application.
{"title":"Controlling user interaction","authors":"D. Kasik","doi":"10.1145/563274.563296","DOIUrl":"https://doi.org/10.1145/563274.563296","url":null,"abstract":"The user of an interactive application is in an anamolous position, especially if he is not one of the elite class known as \"computer bums\". This mythical user is at the end of a process totally controlled by a computer and a program. His communications with the program may suffer greatly because of this total dependence.Control of communication in the batch environment is much more a one-way street. Here the user supplies the program data, and the batch program informs him if something has gone wrong by evicting his run from the machine. The user then consults available documentation (if it exists) or a computer expert (if one exists) for help in solving the problem. The communication between program and user is not critical in this environment; the user is expected to know what to do before he starts the run and can seek assistance outside of the computer.The interactive environment, however, has the user totally at the mercy of the program for diagnostic and prompting information. Even sophisticated graphics-oriented applications, which provide large amounts of useful information through pictures, may not adequately control the user's interaction. The user needs direction imposed on him to successfully solve his problem. At the same time, the system must provide flexibility, i.e., he must not be constrained to a single path of action that may only suit the code's implementor. No user's manual can capture a flow of this nature because of the inherently static nature of words on paper. Furthermore, paging back and forth in a manual to decipher what is to be done next destroys the spontaneity implicit in a successful interactive system.The user must be the main concern of the interactive system for it to be successful. With this goal in mind, Battelle-Columbus has developed a structured approach to controlling user interaction. The approach benefits the implementor as well as the user. It places emphasis on design and checkout of interaction as the first, rather than the last, step in an interactive application.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117272165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Potoczniak, M. Kosmin, R. Larkin, J. Callahan, R. M. Dunn
This report represents data relative to the alternative consideration involved in selecting a configuration for the Interactive Graphics Networking System, (IGNS). The IGNS permits a user to interactively view a network, modify it, if needed, analyze various management options and view their impact upon the data contained in the network, and, finally receive network plots and management reports.A prototype of this system was developed and tested for feasibility. Having proven the feasibility, the purpose of this report is to provide the data necessary for a user to decide the individual optimum system configuration which may be used to facilitate an interactive networking reporting capability.
{"title":"Affordability of computer graphics for planning networks in DOD program management","authors":"J. Potoczniak, M. Kosmin, R. Larkin, J. Callahan, R. M. Dunn","doi":"10.1145/563274.563313","DOIUrl":"https://doi.org/10.1145/563274.563313","url":null,"abstract":"This report represents data relative to the alternative consideration involved in selecting a configuration for the Interactive Graphics Networking System, (IGNS). The IGNS permits a user to interactively view a network, modify it, if needed, analyze various management options and view their impact upon the data contained in the network, and, finally receive network plots and management reports.A prototype of this system was developed and tested for feasibility. Having proven the feasibility, the purpose of this report is to provide the data necessary for a user to decide the individual optimum system configuration which may be used to facilitate an interactive networking reporting capability.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126600594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Laser-Scan HRD-1 is both a large screen, high resolution interactive storage display and a high quality precision film plotter. It is therefore relevant to both the interactive editing and the production aspects of computer graphics systems, and its characteristics are particularly suited to application areas such as automated cartography, in which large amounts of graphical data have to be displayed and manipulated.
{"title":"The HRD-1 laser display system","authors":"P. Woodsford","doi":"10.1145/563274.563289","DOIUrl":"https://doi.org/10.1145/563274.563289","url":null,"abstract":"The Laser-Scan HRD-1 is both a large screen, high resolution interactive storage display and a high quality precision film plotter. It is therefore relevant to both the interactive editing and the production aspects of computer graphics systems, and its characteristics are particularly suited to application areas such as automated cartography, in which large amounts of graphical data have to be displayed and manipulated.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122405400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In 1974 Ed Catmull developed a new algorithm for rendering images of bivariate surface patches. This paper describes extensions of this algorithm in the areas of texture simulation and lighting models.The parametrization of a patch defines a coordinate system which is used as a key for mapping patterns onto the surface. The parametric values within each picture element are input to a pattern definition function. A weighted average of the values of this function over the picture element scales the intensity of that picture element. By suitably defining the pattern function, various surfaces textures can be simulated. The shape and size of this weighting function is chosen using digital signal processing theory.The other problem addressed here concerns lighting models. The patch rendering algorithm allows accurate computation of the surface.
{"title":"Texture and reflection in computer generated images","authors":"J. Blinn, Martin E. Newell","doi":"10.1145/563274.563322","DOIUrl":"https://doi.org/10.1145/563274.563322","url":null,"abstract":"In 1974 Ed Catmull developed a new algorithm for rendering images of bivariate surface patches. This paper describes extensions of this algorithm in the areas of texture simulation and lighting models.The parametrization of a patch defines a coordinate system which is used as a key for mapping patterns onto the surface. The parametric values within each picture element are input to a pattern definition function. A weighted average of the values of this function over the picture element scales the intensity of that picture element. By suitably defining the pattern function, various surfaces textures can be simulated. The shape and size of this weighting function is chosen using digital signal processing theory.The other problem addressed here concerns lighting models. The patch rendering algorithm allows accurate computation of the surface.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124793616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Although animation processing capability can be extremely valuable in certain graphics programs, its application is generally limited to users of stand alone, single user graphics systems. This paper describes an organization of software which enables a host program to define and control animations for an intelligent satellite graphics system. The discussion centers around the particular system on which it was implemented, but the technique should be general enough to have wide application. The results have significantly enhanced the operating characteristics of programs in the host-satellite environment.
{"title":"Animation on a satellite graphics system","authors":"R. M. Sowar","doi":"10.1145/563274.563303","DOIUrl":"https://doi.org/10.1145/563274.563303","url":null,"abstract":"Although animation processing capability can be extremely valuable in certain graphics programs, its application is generally limited to users of stand alone, single user graphics systems. This paper describes an organization of software which enables a host program to define and control animations for an intelligent satellite graphics system. The discussion centers around the particular system on which it was implemented, but the technique should be general enough to have wide application. The results have significantly enhanced the operating characteristics of programs in the host-satellite environment.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125667084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The terms "conversational" and "extensible" are defined and shown to be useful properties of computer animation systems. A conversational extensible system for the animation of shaded images is then described. With this system, implemented on a minicomputer, the animator can sketch images and movements freehand, or can define them algorithmically via the Smalltalk language. The system is itself implemented in Smalltalk, and hence can be easily extended or mcdified to suit the animator's personal style.
{"title":"A conversational extensible system for the animation of shaded images","authors":"R. Baecker","doi":"10.1145/563274.563281","DOIUrl":"https://doi.org/10.1145/563274.563281","url":null,"abstract":"The terms \"conversational\" and \"extensible\" are defined and shown to be useful properties of computer animation systems. A conversational extensible system for the animation of shaded images is then described. With this system, implemented on a minicomputer, the animator can sketch images and movements freehand, or can define them algorithmically via the Smalltalk language. The system is itself implemented in Smalltalk, and hence can be easily extended or mcdified to suit the animator's personal style.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134630029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A concept of general purpose systems which generate, store, retrieve, process and display raster-scan format images is developed. The general purpose nature of such systems allows the handling of static and dynamic images from multiple sources as well as system synthesized images while precluding the use of special function hardware. A particular system implementation is described. The implementationwas accomplished with standard digital computer and video hardware with the exception of one special hybrid subsystem. Most of the equipment belongs to the digital computer class with the only video hardware being a standard broadcast television receiver. The system has application to many areas including computer animation, medicine, computerized picture libraries and the study of the mechanisms of visual perception. Problems and future developments are discussed.This research was supported in part by the National Science Foundation Division of Mathematical and Computer Sciences under grant DCR 74-00768A01.
{"title":"A digital video information storage and retrieval system","authors":"A. J. Myers","doi":"10.1145/563274.563283","DOIUrl":"https://doi.org/10.1145/563274.563283","url":null,"abstract":"A concept of general purpose systems which generate, store, retrieve, process and display raster-scan format images is developed. The general purpose nature of such systems allows the handling of static and dynamic images from multiple sources as well as system synthesized images while precluding the use of special function hardware. A particular system implementation is described. The implementationwas accomplished with standard digital computer and video hardware with the exception of one special hybrid subsystem. Most of the equipment belongs to the digital computer class with the only video hardware being a standard broadcast television receiver. The system has application to many areas including computer animation, medicine, computerized picture libraries and the study of the mechanisms of visual perception. Problems and future developments are discussed.This research was supported in part by the National Science Foundation Division of Mathematical and Computer Sciences under grant DCR 74-00768A01.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117028649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
After experiments with more traditional editors, TYPER, an editor designed specifically for the online composition and editing of text, was developed. TYPER uses the 20 lines of a CRT terminal screen to implement a window onto the writer's text that can be moved at will. All normal typewriter functions are available plus special functions for the easy insertion, deletion, and modification of text. A non-destructive cursor can be moved about the screen and acts as a pointer to the text. Any printable character typed is immediately placed in the text at the position indicated by the cursor and the change is reflected on the screen. Insertion and deletion of text is accomplished with simple keystrokes. After an insertion or deletion, any extra space between words and space at the end of short lines is filled by "closing" the text. Successive words are placed so that they are separated by one space and extra space at the end of a line is filled with words from the succeeding line.Response to TYPER has been excellent. Non-programmers and even those with no computer experience learn its use quickly and are loath to go back to typewriters after using it. In addition, programmers are using it to edit their program code.
{"title":"Typer: an editor for the online composition of text","authors":"Richard P. Sonderegger","doi":"10.1145/563274.563275","DOIUrl":"https://doi.org/10.1145/563274.563275","url":null,"abstract":"After experiments with more traditional editors, TYPER, an editor designed specifically for the online composition and editing of text, was developed. TYPER uses the 20 lines of a CRT terminal screen to implement a window onto the writer's text that can be moved at will. All normal typewriter functions are available plus special functions for the easy insertion, deletion, and modification of text. A non-destructive cursor can be moved about the screen and acts as a pointer to the text. Any printable character typed is immediately placed in the text at the position indicated by the cursor and the change is reflected on the screen. Insertion and deletion of text is accomplished with simple keystrokes. After an insertion or deletion, any extra space between words and space at the end of short lines is filled by \"closing\" the text. Successive words are placed so that they are separated by one space and extra space at the end of a line is filled with words from the succeeding line.Response to TYPER has been excellent. Non-programmers and even those with no computer experience learn its use quickly and are loath to go back to typewriters after using it. In addition, programmers are using it to edit their program code.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125986367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A new system, that of matrix grammars, for two-dimensional picture processing, is introduced. A hierarchy, induced on Chomsky's is found. Language operations such as union, catenation (row and column), Kleene's closure (row and column), and homomorphisms are investigated. It is found that the smallest class of these languages may serve as the class of arrays, which is defined as the smallest class of arrays closed under union, catenation (row and column) and Kleene's closure (row and column). Eight possible ways of defining a matrix language are discussed and it is suggested that one of them may lead to a normal form of matrix grammars. The method is advantageous over others on several points. Perhaps the most interesting of all is that it provides a compromise between purely sequential methods, which take too much time for large arrays and purely parallel methods, which usually take too much hardware for large arrays.
{"title":"Sequential/parallel matrix picture languages","authors":"P. Wang, W. Grosky","doi":"10.1145/563274.563276","DOIUrl":"https://doi.org/10.1145/563274.563276","url":null,"abstract":"A new system, that of matrix grammars, for two-dimensional picture processing, is introduced. A hierarchy, induced on Chomsky's is found. Language operations such as union, catenation (row and column), Kleene's closure (row and column), and homomorphisms are investigated. It is found that the smallest class of these languages may serve as the class of arrays, which is defined as the smallest class of arrays closed under union, catenation (row and column) and Kleene's closure (row and column). Eight possible ways of defining a matrix language are discussed and it is suggested that one of them may lead to a normal form of matrix grammars. The method is advantageous over others on several points. Perhaps the most interesting of all is that it provides a compromise between purely sequential methods, which take too much time for large arrays and purely parallel methods, which usually take too much hardware for large arrays.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123233895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The research described in this paper addresses the problems associated with the design of systems for efficiently producing computer-generated pictures and picture sequences of very complex, three-dimensional environments. The thesis of the research is that the geometric structure inherent in the definition of the shapes of three-dimensional objects and environments must be used not just to define their relative motion and placement but also to assist in solving many other problems of systems for producing pictures by computer.The implications are that by using an extension of traditional structure information, or a geometric hierarchy, five significant improvements to current techniques are possible. First, the range of complexity of an environment is greatly increased while the visible complexity of any given scene is kept within a fixed upper limit. Second, a meaningful way is provided to vary the amount of detail presented in a scene both according to the screen area occupied by the objects in the scene and according to camera and object motions. Third, by using the geometric hierarchy, "clipping" becomes a very fast logarithmic search for the resolvable parts of the environment within the field-of-view. Fourth, by using this positional hierarchy in conjunction with a storage hierarchy of the sort used in virtual memory computing systems, frame-to-frame coherence and clipping define a graphical "working set", or fraction of the total structure that should be present in primary store for immediate access by the visible-surface algorithms. Finally, the proposed structural framework suggests a new recursive descent visible-surface algorithm in which the computation time grows almost linearly with a scene's visible complexity rather than as a worse than linear function of its object-space complexity.
{"title":"Hierarchical geometric models for visible-surface algorithms","authors":"James H. Clark","doi":"10.1145/563274.563323","DOIUrl":"https://doi.org/10.1145/563274.563323","url":null,"abstract":"The research described in this paper addresses the problems associated with the design of systems for efficiently producing computer-generated pictures and picture sequences of very complex, three-dimensional environments. The thesis of the research is that the geometric structure inherent in the definition of the shapes of three-dimensional objects and environments must be used not just to define their relative motion and placement but also to assist in solving many other problems of systems for producing pictures by computer.The implications are that by using an extension of traditional structure information, or a geometric hierarchy, five significant improvements to current techniques are possible. First, the range of complexity of an environment is greatly increased while the visible complexity of any given scene is kept within a fixed upper limit. Second, a meaningful way is provided to vary the amount of detail presented in a scene both according to the screen area occupied by the objects in the scene and according to camera and object motions. Third, by using the geometric hierarchy, \"clipping\" becomes a very fast logarithmic search for the resolvable parts of the environment within the field-of-view. Fourth, by using this positional hierarchy in conjunction with a storage hierarchy of the sort used in virtual memory computing systems, frame-to-frame coherence and clipping define a graphical \"working set\", or fraction of the total structure that should be present in primary store for immediate access by the visible-surface algorithms. Finally, the proposed structural framework suggests a new recursive descent visible-surface algorithm in which the computation time grows almost linearly with a scene's visible complexity rather than as a worse than linear function of its object-space complexity.","PeriodicalId":160433,"journal":{"name":"Proceedings of the 3rd annual conference on Computer graphics and interactive techniques","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114228318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：