Proceedings of the 10th annual conference on Computer graphics and interactive techniques最新文献

{"title":"Graphics in overlapping bitmap layers","authors":"R. Pike","doi":"10.1145/800059.801165","DOIUrl":"https://doi.org/10.1145/800059.801165","url":null,"abstract":"One of the common uses of bitmap terminals is storing multiple programming contexts in multiple, possibly overlapping, areas of the screen called windows. Windows traditionally store the visible state of a programming environment, such as an editor or debugger, while the user works with some other program. This model of interaction is attractive for one-process systems, but to make full use of a multiprogramming environment, windows must be asynchronously updated, even when partially or wholly obscured by other windows. For example, a long compilation may run in one window, displaying messages as appropriate, while the user edits a file in another window. This paper describes a set of low-level graphics primitives to manipulate overlapping asynchronous windows, called layers, on a bitmap display terminal. Unlike previous window software, these primitives extend the domain of the general bitmap operator bitblt to include bitmaps that are partially or wholly obscured.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121871747","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":"Near real-time shaded display of rigid objects","authors":"H. Fuchs, G. Abram, E. Grant","doi":"10.1145/800059.801134","DOIUrl":"https://doi.org/10.1145/800059.801134","url":null,"abstract":"Described is a visible surface algorithm and an implementation that generates shaded display of objects with hundreds of polygons rapidly enough for interactive use — several images per second. The basic algorithm, introduced in [Fuchs, Kedem and Naylor, 1980], is designed to handle rigid objects and scenes by preprocessing the object data base to minimize visibility computation cost. The speed of the algorithm is further enhanced by its simplicity, which allows it to be implemented within the internal graphics processor of a general purpose raster system.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122039906","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":"Technical implications of proposed graphics standards (Panel Session)","authors":"David H. Straayer, P. Bono, R. Ehlers, G. Enderle, T. Reed, David Shuey, M. Skall, Elaine L. Sonderegger, Tom Wright","doi":"10.1145/800059.801138","DOIUrl":"https://doi.org/10.1145/800059.801138","url":null,"abstract":"This panel session is intended to present recent technical developments in the efforts to standardize computer graphics. Several alternative approaches to 3-D standards will be presented and contrasted. The Virtual Device Metafile will be presented, as well as a proposed binding of the GKS standard to Fortran. Presentations will be made by the following individuals: Dr. Peter Bono is the chairman of the ANSI X3H3 technical committee developing standards for Computer Graphics Programming Languages, and will present the current status of the effort to adopt 2-D GKS as an International Standard and as an American National Standard. Tom Wright will be available to respond to questions about the Programmer's Minimal Interface to Graphics (PMIG) proposal, and its current status as a new output level of the draft proposed American National Standard (dpANS) GKS. Mark Skall will present a proposed binding of GKS to the Fortran Language. Mr. Skall will also discuss progress in the field of formal specification of graphics standards and developments in the establishment of conformance/certification procedures for implementations of GKS. Theodore Reed will present the technical content of the Virtual Device Metafile (VDM) draft proposed American National Standard. Discussed will be the relationship of the VDM to GKS and to the yet to be proposed Virtual Device Interface. Specific functionality of the VDM will be discussed as will specific bindings of that functionality as a character set extension and as a binary format. David Shuey will present an overview of the Programmer's Hierarchical Interface to Graphics (PHIGS) proposal. The PHIGS proposal is intended to support hierarchical structuring of graphics data, in contrast to the Core System and GKS proposals. This type of structure addresses highly interactive graphics applications which need to modify the presentation and the relationships within graphics data. Richard Ehlers will present the attribute model of the PHIGS proposal and explore the relationship of attribute model to structured graphics data bases. Also, Mr. Ehlers will discuss the viewing and transformation implications of structured graphics data bases using examples. Gunter Enderle is a member of the West German delegation to the International Standards Organization (ISO) Working Group on Computer Graphics. Herr Enderle will be discussing ISO proposals for the extension of the GKS standard from 2-D to 3-D functionality. Several such proposals have been made, including one by DIN (the official standards making body of the German Federal Republic) and a Norwegian proposal called IDIGS. Elaine Sonderegger was a member of the ACM SIGGRAPH Graphics Standards Planning Committee, and is the ACM SIGGRAPH representative to ANSI X3H3. Ms. Sonderegger will contrast the 3-D functionality of the Core System, IDIGS, DIN proposed 3-D extensions, and PHIGS.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123440032","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":"Anti-aliased line drawing using brush extrusion","authors":"T. Whitted","doi":"10.1145/800059.801144","DOIUrl":"https://doi.org/10.1145/800059.801144","url":null,"abstract":"This algorithm draws lines on a gray-scale raster display by dragging a “brush” along the path of the line. The style of the line is determined by the properties of the brush. An anti-aliasing calculation is performed once for the brush itself and thereafter only a trivial additional operation is needed for each pixel through which the brush is dragged to yield an anti-aliased line. There are few constraints on the size, shape, and attributes of the brush. Lines can be curved as well as straight, It is possible to produce lines with a three dimensional appearance.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124030135","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":"Curve-fitting with piecewise parametric cubics","authors":"M. Plass, M. Stone","doi":"10.1145/800059.801153","DOIUrl":"https://doi.org/10.1145/800059.801153","url":null,"abstract":"Parametric piecewise-cubic functions are used throughout the computer graphics industry to represent curved shapes. For many applications, it would be useful to be able to reliably derive this representation from a closely spaced set of points that approximate the desired curve, such as the input from a digitizing tablet or a scanner. This paper presents a solution to the problem of automatically generating efficient piecewise parametric cubic polynomial approximations to shapes from sampled data. We have developed an algorithm that takes a set of sample points, plus optional endpoint and tangent vector specifications, and iteratively derives a single parametric cubic polynomial that lies close to the data points as defined by an error metric based on least-squares. Combining this algorithm with dynamic programming techniques to determine the knot placement gives good results over a range of shapes and applications.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124435731","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":"Design of solids with free-form surfaces","authors":"H. Chiyokura, F. Kimura","doi":"10.1145/800059.801160","DOIUrl":"https://doi.org/10.1145/800059.801160","url":null,"abstract":"We propose a unified method of generating a wide range of three dimensional objects from polyhedra to solids with free-form surfaces. Modeling systems for polyhedra and systems for free-form surfaces have been developed independently in the past because of the difference in their underlying theory and practices. However, this is not desirable for a designer. So in this paper, we have shown a method in which a wide range of shapes are generated in one system by using local modifications. Local modifications are procedures used to change the shape of solids locally. The construction and the modification of three dimensional shapes by these procedures are natural and easy for a designer in many cases. The implementation of these procedures in a computer is easy and their execution does not require much time. Our method to construct a solid with free-form surfaces consists of following three phases. 1) A solid which serves as a basis of free-form shape design is generated by local modifications. Edges of this solid are straight lines but its faces are not necessarily flat planes. 2) From this model, a curve model which adequately represents the characteristics of a free-form shape is generated. 3) Surface equations interpolating over the curve model are generated. We have made a geometric modeling system MODIF. Using this system, a complicated solid with free-form surfaces can be designed easily. MODIF can generate color shaded pictures and cutter path data for making a real object model by NC machining tool.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122998401","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":"Topologically reliable display of algebraic curves","authors":"D. Arnon","doi":"10.1145/800059.801152","DOIUrl":"https://doi.org/10.1145/800059.801152","url":null,"abstract":"An algebraic curve is a set of points in the plane satisfying an equation F(x,y) = 0, where F(x,y) is a polynomial in x and y with rational number coefficients. The topological structure of an algebraic curve can be complicated. It may, for example, have multiple components, isolated points, or intricate self-crossings. In the field of Computer Algebra (Symbolic Mathematical Computation), algorithms for exact computations on polynomials with rational number coefficients have been developed. In particular, the cylindrical algebraic decomposition (cad) algorithm of Computer Algebra determines the topological structure of an algebraic curve, given F(x,y) as input. We describe methods for algebraic curve display which, by making use of the cad algorithm, correctly portray the topological structure of the curve. The running times of our algorithms consist almost entirely of the time required for the cad algorithm, which varies from seconds to hours depending on the particular F(x,y).","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128249088","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 parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer","authors":"E. Fiume, A. Fournier, L. Rudolph","doi":"10.1145/800059.801143","DOIUrl":"https://doi.org/10.1145/800059.801143","url":null,"abstract":"Popular approaches to speeding up scan conversion often employ parallel processing. Recently, several special-purpose parallel architectures have been suggested. We propose an alternative to these systems: the general-purpose ultracomputer, a parallel processor with many autonomous processing elements and a shared memory. The “serial semantics/parallel execution” feature of this architecture is exploited in the formulation of a scan conversion algorithm. Hidden surfaces are removed using a single scanline, z-buffer algorithm. Since exact anti-aliasing is inherently slow, a novel parallel anti-aliasing algorithm is presented in which subpixel coverage by edges is approximated using a look-up table. The ultimate intensity of a pixel is the weighted sum of the intensity contribution of the closest edge, that of the “losing” edges, and that of the background. The algorithm is fast and accurate, it is attractive even in a serial environment, and it avoids several artifacts that commonly occur in animated sequences.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126985310","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":"Graphical style towards high quality illustrations","authors":"Richard J. Beach, M. Stone","doi":"10.1145/800059.801141","DOIUrl":"https://doi.org/10.1145/800059.801141","url":null,"abstract":"If there is to be widespread acceptance of computer generated images in areas traditionally served by graphic artists, these images must meet a high standard of quality. Document preparation systems are an application area that is gaining maturity in providing high-quality computer typeset documents. These systems exhibit a trend towards specifying the formatting information for a document separately from the body of the text. The goal is to have the document format designed by someone with expert knowledge of typography. Writers can then apply a format to their own work simply by indicating the semantic content of their text, such as the headings, paragraphs, or footnotes. The result is that a writer can produce properly typeset documents without learning the esthetics of typography. This paper extends this idea to encompass the illustrations in the text. We have developed a prototype system that uses a set of graphical style rules to define the design guidelines for the illustrations. The rules, called a graphical style sheet, can be used to control a uniform “look” over a set of illustrations, or to change the appearance of a particular illustration to reflect different publishing styles or different media. The prototype coordinates with an existing document preparation system and the combined systems were used to produce this paper. We conclude that this is a viable method for controlling image style for at least one class of illustrations. This approach contributes to image quality by providing a method for capturing knowledge of graphic arts standards, and for ensuring a consistent appearance of related illustrations within technical documentation.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"14 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123602449","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 algebraic surfaces","authors":"P. Hanrahan","doi":"10.1145/800059.801136","DOIUrl":"https://doi.org/10.1145/800059.801136","url":null,"abstract":"Many interesting surfaces can be written as polynomial functions of the spatial coordinates, often of low degree. We present a method based on a ray casting algorithm, extended to work in more than three dimensions, to produce pictures of these surfaces. The method uses a symbolic algebra system to automatically derive the equation of intersection between the ray and the surface and then solves this equation using an exact polynomial root finding algorithm. Included are illustrations of the cusp catastrophe surface, and two unusually shaped quartic surfaces, Kummer's quadruple and Steiner's surface.","PeriodicalId":381383,"journal":{"name":"Proceedings of the 10th annual conference on Computer graphics and interactive techniques","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114205276","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}