{"title":"The Geometry Engine: A VLSI Geometry System for Graphics","authors":"James H. Clark","doi":"10.1145/800064.801272","DOIUrl":"https://doi.org/10.1145/800064.801272","url":null,"abstract":"The Geometry Engine[1] is a special-purpose VLSI processor for computer graphics. It is a four-component vector, floating-point processor for accomplishing three basic operations in computer graphics: matrix transformations, clipping and mapping to output device coordinates. This paper describes the Geometry Engine and the Geometric Graphics System it composes. It presents the instruction set of the system, its design motivations and the Geometry System architecture.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124441824","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}
{"title":"A user interface management system","authors":"D. Kasik","doi":"10.1145/800064.801268","DOIUrl":"https://doi.org/10.1145/800064.801268","url":null,"abstract":"The design and construction of the user interface to interactive systems is receiving increased attention. This paper describes a user interface management system that allows a designer/developer to focus on the logical functionality of an application without the usual bookkeeping associated with a conventional programming language. The user interface management system contains two components: a special purpose, application independent dialogue specification language and a run-time interpreter that provides a number of interaction extensions not possible with procedure libraries.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121956602","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}
{"title":"A new general triangulation method for planar contours","authors":"S. Ganapathy, T. G. Dennehy","doi":"10.1145/800064.801264","DOIUrl":"https://doi.org/10.1145/800064.801264","url":null,"abstract":"The problem of approximating the surface spanning a given set of 3D points as a polyhedron of triangular faces (“triangulation”) is a significant one, and has many applications in the fields of computer graphics and computer vision. In this paper, several solutions to this problem are reviewed. These solutions can be grouped into two classes, and particular emphasis is given to the class of surfaces spanned by parallel planar contours. For a contour pair P0,P1,...Pm−1 and Q0,Q1,...Qn−1, a graph theoretic approach can be used to arrive at a class of solutions, each requiring exactly m+n steps to triangulate the pair. Existing methods (both rigorous and heuristic) for extracting a particular solution from this group are reviewed, and a new heuristic based on inter-contour coherence is proposed. This heuristic is being used in the field of Ultrasonic Non-destructive Evaluation to produce images of flaws in pressure vessels, and its performance is shown to compare favorably with methods of greater computational complexity. It is believed that this heuristic can also be used with success in industrial vision systems where similar contours are obtained using a laser range finder.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128302468","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}
{"title":"Ray tracing parametric patches","authors":"J. Kajiya","doi":"10.1145/800064.801287","DOIUrl":"https://doi.org/10.1145/800064.801287","url":null,"abstract":"This paper describes an algorithm that uses ray tracing techniques to display bivariate polynomial surface patches. A new intersection algorithm is developed which uses ideas from algebraic geometry to obtain a numerical procedure for finding the intersection of a ray and a patch without subdivision. The algorithm may use complex coordinates for the (u, v)-parameters of the patches. The choice of these coordinates makes the computations more uniform, so that there are fewer special cases to be considered. In particular, the appearance and disappearance of silhouette edges can be handled quite naturally. The uniformity of these techniques may be suitable for implementation on either a general purpose pipelined machine, or on special purpose hardware.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128419827","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}
{"title":"Path specification and path coherence","authors":"K. Shelley, D. Greenberg","doi":"10.1145/800064.801276","DOIUrl":"https://doi.org/10.1145/800064.801276","url":null,"abstract":"This paper presents an interactive method for specifying a path in space and time through a three-dimensional environment. A sequence is generated by showing the series of views along the path. The sequence is previewed on a vector scope, and after it is interactively refined, each frame is rendered on a raster device. The path is represented by a B-spline to provide smooth, continuous motion. The timing along the path is also defined by a B-spline so that changes in velocity are smooth. The use of “path coherence” is introduced. The utilization of the available data from the a priori temporal and spatial path definition holds great promise for frame to frame coherence. The path coherence can be used to reduce the number of polygons which need to be considered in a viewed environment. This reduction makes the previewing of complex environments appear less cluttered. Furthermore, the computational expense of the culling and sorting operations in the visible line/surface determination is reduced. One sample usage of this is a tree-structured partitioned environment where the priority ordering of the environment must be changed only when the path crosses a partition boundary.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127165196","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}
{"title":"FLAIR - user interface dialog design tool","authors":"P. Wong, Eric R. Reid","doi":"10.1145/800064.801267","DOIUrl":"https://doi.org/10.1145/800064.801267","url":null,"abstract":"To aid the system designers in achieving early involvement of the users, FLAIR (a user interface dialog design tool) was conceptualized and developed. FLAIR allows the designer to rapidly prototype a system's Man-Machine Interface. A system designer can select a desired mix of input/output devices ranging from voice to high resolution graphics equipment. FLAIR prompts its users with a dynamic menu according to a pre-defined English-like syntax. Commands are entered by the designer's own voice. Entered commands are validated by voice pattern recognition and command language-gating. Pointing devices are used to locate, place, and/or pick objects from the RAMTEK 9400 25” high-resolution color monitor. The graphics display portion of FLAIR is handled by a Core Standard graphics package. This particular package also fits the specific needs of FLAIR in that it makes available most of the RAMTEK 9400's hardware features. A relational DBMS has been integrated into FLAIR in order to manage system and user-defined data relationships. The user-defined data can be associated with a particular on-screen graphics symbol, and can then be queried at a later time. In addition to single graphics snapshots (or “static frames”), FLAIR allows the system designer to create command menu hierarchies for “dynamic scenarios.” This allows the designer to simulate, through client menu item selection, the system control flow. He can, in effect, create a tree of menus, traverse the tree at will, and select more menus or system actions as desired. All menus appear as sensitized areas on the graphics screen, and can be selected via any of the available input devices. It is estimated that a system designer can greatly improve his dialog design productivity by using FLAIR. The designers need not code any formal programs. The designer need not master the usage of the host computer, the graphic input/output systems, the menu controls, or the database programming before his designs are realized. FLAIR is there to assimilate, assemble, save and exercise his instructed operator dialog.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130005459","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}
David H. Straayer, Tom Wright, T. Reed, David Shuey, Bruce Cohen, Bradford M. Smith
{"title":"The impact of graphics standards an American point of view (Panel Session)","authors":"David H. Straayer, Tom Wright, T. Reed, David Shuey, Bruce Cohen, Bradford M. Smith","doi":"10.1145/800064.801256","DOIUrl":"https://doi.org/10.1145/800064.801256","url":null,"abstract":"This panel session will consist of reports from participants in the effort to standardize computer graphics functions in America. There are two principal goals. The first is to provide status reports for the groups represented by the panelists. The second is to explain relationships between different standardization efforts.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126528865","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}
{"title":"Special purpose automatic programming for hidden surface elimination","authors":"C. Goad","doi":"10.1145/800064.801277","DOIUrl":"https://doi.org/10.1145/800064.801277","url":null,"abstract":"In many applications of three dimensional computer graphics, the appearance of the same scene must be computed repeatedly for many different positions of the viewer. This paper concerns a scheme for exploiting this property of an application for the purpose of improving the efficiency of the hidden surface computation. The scheme involves a kind of automatic programming: for each scene to be considered, a different special purpose program is automatically constructed. The special purpose program then takes the position of the viewer as input, and generates a suitable description of the scene with hidden surfaces removed as output. Since the special purpose program has a very limited task to perform - it is adapted to handling just one scene - it can be much faster than any general purpose algorithm would be for the same scene. The paper describes a method by which special purpose programs for hidden surface elimination can be constructed in a fully automatic manner. The method has been implemented, and results of experiments are given.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114772373","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}
{"title":"A contour display generation algorithm for VLSI implementation","authors":"M. Zyda","doi":"10.1145/800064.801273","DOIUrl":"https://doi.org/10.1145/800064.801273","url":null,"abstract":"Recent articles have discussed the current trend towards designing raster graphics algorithms into VLSI chips. The purpose of these design efforts is to capture some of the real-time animation capability found in vector graphics systems. Currently, real-time vector graphics animation is limited primarily to operations involving coordinate transformations. In order to enhance this animation capability, frequently encountered vector graphics algorithms that require the high speed, parallel computation capability of VLSI must be identified. Real-time contour display generation from grid data is one such algorithm. This paper describes the specifics of a contour display generation algorithm, the architectural framework of a processor that performs this algorithm and the architectural requirements of such a processor. The contouring algorithm is based on a data structure, the contouring tree, whose regularity and amenability for parallel computation make it an ideal candidate for VLSI. The architectural framework for a contouring processor chip that performs this algorithm for the real-time environment of interactive graphics is discussed, particularly the issues of memory size and data distribution. A model of the contouring process is created in order to determine the necessary physical parameters of the contouring processor in this architectural framework. Conclusions are drawn concerning the feasibility of producing a VLSI chip that performs this contouring algorithm.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116311143","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}
D. Rosenthal, J. Michener, G. Pfaff, Rens Kessener, M. Sabin
{"title":"The detailed semantics of graphics input devices","authors":"D. Rosenthal, J. Michener, G. Pfaff, Rens Kessener, M. Sabin","doi":"10.1145/800064.801257","DOIUrl":"https://doi.org/10.1145/800064.801257","url":null,"abstract":"The concept of virtual input devices, enunciated by Wallace, has been the accepted basis for producing device-independent interactive graphics systems. It was used by GSPC for the Core System, and it underlies the draft international standard GKS. During the recently concluded technical review of GKS, the input facilities became a bone of contention. The discussions revealed many inadequacies in the virtual input device concept, and were finally resolved using a refined and extended model of input, which is presented here by some of the participants in the discussions. Examples are included, showing how the GKS facilities derive from the model, and the Core's “STROKE” device is used to show how the model controls future extensions to GKS. The model is also used to describe the other differences between the input facilities of the Core System and GKS.","PeriodicalId":276450,"journal":{"name":"Proceedings of the 9th annual conference on Computer graphics and interactive techniques","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131015072","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}