Texture-map computations can be made tractable through use of precalculated tables which allow computational costs independent of the texture density. The first example of this technique, the “mip” map, uses a set of tables containing successively lower-resolution representations filtered down from the discrete texture function. An alternative method using a single table of values representing the integral over the texture function rather than the function itself may yield superior results at similar cost. The necessary algorithms to support the new technique are explained. Finally, the cost and performance of the new technique is compared to previous techniques.
{"title":"Summed-area tables for texture mapping","authors":"F. Crow","doi":"10.1145/800031.808600","DOIUrl":"https://doi.org/10.1145/800031.808600","url":null,"abstract":"Texture-map computations can be made tractable through use of precalculated tables which allow computational costs independent of the texture density. The first example of this technique, the “mip” map, uses a set of tables containing successively lower-resolution representations filtered down from the discrete texture function. An alternative method using a single table of values representing the integral over the texture function rather than the function itself may yield superior results at similar cost. The necessary algorithms to support the new technique are explained. Finally, the cost and performance of the new technique is compared to previous techniques.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133901519","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}
An algorithm for computing ray traced pictures is presented, which adaptively subdivides scenes into S subregions, each with roughly uniform load. It can yield speedups of O(S2/3) over the standard algorithm. This algorithm can be mapped onto a parallel architecture consisting of a three dimensional array of computers which operate autonomously. The algorithm and architecture are well matched, so that communication overhead is small with respect to the computation, for sufficiently complex scenes. This allows close to linear improvements in performance, even with thousands of computers, in addition to the improvement due to subdivision. The algorithm and architecture provide mechanisms to gracefully degrade in response to excessive load. The architecture also tolerates failures of computers without errors in the computation.
{"title":"An adaptive subdivision algorithm and parallel architecture for realistic image synthesis","authors":"Mark A. Z. Dippé, J. Swensen","doi":"10.1145/800031.808592","DOIUrl":"https://doi.org/10.1145/800031.808592","url":null,"abstract":"An algorithm for computing ray traced pictures is presented, which adaptively subdivides scenes into S subregions, each with roughly uniform load. It can yield speedups of O(S2/3) over the standard algorithm. This algorithm can be mapped onto a parallel architecture consisting of a three dimensional array of computers which operate autonomously. The algorithm and architecture are well matched, so that communication overhead is small with respect to the computation, for sufficiently complex scenes. This allows close to linear improvements in performance, even with thousands of computers, in addition to the improvement due to subdivision. The algorithm and architecture provide mechanisms to gracefully degrade in response to excessive load. The architecture also tolerates failures of computers without errors in the computation.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115838224","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}
This paper presents a new method for using cubic interpolating splines in a key frame animation system. Three control parameters allow the animator to change the tension, continuity, and bias of the splines. Each of these three parameters can be used for either local or global control. Our technique produces a very general class of interpolating cubic splines which includes the cardinal splines as a proper subset.
{"title":"Interpolating splines with local tension, continuity, and bias control","authors":"D. Kochanek, R. Bartels","doi":"10.1145/800031.808575","DOIUrl":"https://doi.org/10.1145/800031.808575","url":null,"abstract":"This paper presents a new method for using cubic interpolating splines in a key frame animation system. Three control parameters allow the animator to change the tension, continuity, and bias of the splines. Each of these three parameters can be used for either local or global control. Our technique produces a very general class of interpolating cubic splines which includes the cardinal splines as a proper subset.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128980988","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}
Priority windows are a basic tool for interactive graphics, underlying such techniques as pop-up menus and single screen viewing and control of multiple contexts. Most implementations of priority windows are raster oriented, frequently relying on special hardware capabilities such as high speed rasterops. This paper discusses an alternative approach, based on vector clipping, that works with any display device capable of drawing and erasing vectors. It has been used to implement a general purpose windowing package that supports application programs using a vector graphics model. It is device independent, running without change on a desktop computer with integral graphics and on a timesharing system with a peripheral display. In purely device independent form, windowing performance depends on host processing speed and communications bandwidth. Techniques are described for improving responsiveness by overlapping some windowing computations with the user's think time. Performance improvements based on extended device capabilities such as rectangular fill, hardware characters, and local display lists with clipping are also suggested. Presentation of this paper included a videotape showing the dynamics of one application on an HP-9000 desktop computer and on a VAX 11/780 plus Ramtek Marquis configuration.
{"title":"Priority windows: A device independent, vector oriented approach","authors":"R. Littlefield","doi":"10.1145/800031.808597","DOIUrl":"https://doi.org/10.1145/800031.808597","url":null,"abstract":"Priority windows are a basic tool for interactive graphics, underlying such techniques as pop-up menus and single screen viewing and control of multiple contexts. Most implementations of priority windows are raster oriented, frequently relying on special hardware capabilities such as high speed rasterops. This paper discusses an alternative approach, based on vector clipping, that works with any display device capable of drawing and erasing vectors. It has been used to implement a general purpose windowing package that supports application programs using a vector graphics model. It is device independent, running without change on a desktop computer with integral graphics and on a timesharing system with a peripheral display. In purely device independent form, windowing performance depends on host processing speed and communications bandwidth. Techniques are described for improving responsiveness by overlapping some windowing computations with the user's think time. Performance improvements based on extended device capabilities such as rectangular fill, hardware characters, and local display lists with clipping are also suggested. Presentation of this paper included a videotape showing the dynamics of one application on an HP-9000 desktop computer and on a VAX 11/780 plus Ramtek Marquis configuration.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131078175","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}
By adopting the Graphical Kernel System (GKS), groups who manipulate pixelated images can take advantage of device independent graphics without giving up the functions which have traditionally been hardware dependent. Most of these functions, including image I/O, zoom, pan, lookup table manipulation, and cursor reading, are supported within GKS; several other functions, such as the use of multiple image planes and multiple look up tables, are accomodated by the GKS Escape and the Generalized Drawing Primitive (GDP). Because GKS has powerful inquire capabilities, it's possible to tightly customize applications code to a particular hardware display device. The inquire functions also can be used by an applications program to determine the hardware display size and thus avoid resampling of a pixelated image. GKS thoroughly separates applications programs from device- dependencies; however, device drivers must still be written. The time and effort of writing device drivers can be largely eliminated by using a single programmable device driver, which is tailored to each device by a GRAPHCAP configuration file, in much the same way as TERMCAP is used by Berkeley Unix implementations.
{"title":"GKS for imaging","authors":"C. Stoll","doi":"10.1145/800031.808609","DOIUrl":"https://doi.org/10.1145/800031.808609","url":null,"abstract":"By adopting the Graphical Kernel System (GKS), groups who manipulate pixelated images can take advantage of device independent graphics without giving up the functions which have traditionally been hardware dependent. Most of these functions, including image I/O, zoom, pan, lookup table manipulation, and cursor reading, are supported within GKS; several other functions, such as the use of multiple image planes and multiple look up tables, are accomodated by the GKS Escape and the Generalized Drawing Primitive (GDP). Because GKS has powerful inquire capabilities, it's possible to tightly customize applications code to a particular hardware display device. The inquire functions also can be used by an applications program to determine the hardware display size and thus avoid resampling of a pixelated image. GKS thoroughly separates applications programs from device- dependencies; however, device drivers must still be written. The time and effort of writing device drivers can be largely eliminated by using a single programmable device driver, which is tailored to each device by a GRAPHCAP configuration file, in much the same way as TERMCAP is used by Berkeley Unix implementations.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130904735","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}
Graphics standards are formally sanctioned guidelines for graphics programming. Just as ANSI standards provide FORTRAN programmers with a common ground among compilers, the role of graphics standards is to define a set of common procedures or subroutines for developing graphics applications. The primary objectives underlying graphics standards are program portability and a common methodology for application program development. Graphic standards are clearly desirable and efforts to bring them about are well underway. Nevertheless, the role of graphics standards must be matched with the reality of software development environments. A common problem faced by all standards committees is the very long lead time required to arrive at consensus. Most standards groups are staffed by volunteers, chartered to develop standards models around generally-accepted current professional practices. Often, this is a time-consuming process relying on compromise and diplomacy and hampered by long intervals between meetings. As a result, standards inevitably lag behind the industry, where competitive hardware vendors play leapfrog with one another, pushing the state of the art. Much of the concern surrounding standards implementations stems from the low level of standards literacy in the graphics user community. Beyond a vague understanding of functionality, most graphics software shoppers have little understanding on the different levels of standards, how to measure a good implementation, and methods of programming efficiently using a graphics standards methodology. As a result, standards-based packages face the difficult challenge of balancing the theoretical world of standards with the down to-earth needs of application developers working against deadlines. This session will measure the several standards proposals now in the ANSI pipeline against the requirements and literacy level of the buying public. The evolution of a standard through ANSI and the implications of certification procedures will be presented and discussed. The problems of implementing a graphics standard will also be discussed, along with the general buying criteria to follow when shopping for standards-based graphics software.
{"title":"The role and reality of graphics standards (Panel)","authors":"J. Warner","doi":"10.1145/800031.808603","DOIUrl":"https://doi.org/10.1145/800031.808603","url":null,"abstract":"Graphics standards are formally sanctioned guidelines for graphics programming. Just as ANSI standards provide FORTRAN programmers with a common ground among compilers, the role of graphics standards is to define a set of common procedures or subroutines for developing graphics applications. The primary objectives underlying graphics standards are program portability and a common methodology for application program development. Graphic standards are clearly desirable and efforts to bring them about are well underway. Nevertheless, the role of graphics standards must be matched with the reality of software development environments. A common problem faced by all standards committees is the very long lead time required to arrive at consensus. Most standards groups are staffed by volunteers, chartered to develop standards models around generally-accepted current professional practices. Often, this is a time-consuming process relying on compromise and diplomacy and hampered by long intervals between meetings. As a result, standards inevitably lag behind the industry, where competitive hardware vendors play leapfrog with one another, pushing the state of the art. Much of the concern surrounding standards implementations stems from the low level of standards literacy in the graphics user community. Beyond a vague understanding of functionality, most graphics software shoppers have little understanding on the different levels of standards, how to measure a good implementation, and methods of programming efficiently using a graphics standards methodology. As a result, standards-based packages face the difficult challenge of balancing the theoretical world of standards with the down to-earth needs of application developers working against deadlines. This session will measure the several standards proposals now in the ANSI pipeline against the requirements and literacy level of the buying public. The evolution of a standard through ANSI and the implications of certification procedures will be presented and discussed. The problems of implementing a graphics standard will also be discussed, along with the general buying criteria to follow when shopping for standards-based graphics software.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127905804","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}
During the next 5 - 10 years, text and graphic systems will tend to merge because of the demand for a more productive man/machine interface, failing memory costs and the availability of higher performance VLSI controllers. This panel will discuss video controllers, memory components and their architectures, graphic systems configurations and the evolution of enhanced system performance versus reduced system cost.
{"title":"Trends in semiconductor hardware for graphics systems (Panel)","authors":"H. Fuchs","doi":"10.1145/800031.808591","DOIUrl":"https://doi.org/10.1145/800031.808591","url":null,"abstract":"During the next 5 - 10 years, text and graphic systems will tend to merge because of the demand for a more productive man/machine interface, failing memory costs and the availability of higher performance VLSI controllers. This panel will discuss video controllers, memory components and their architectures, graphic systems configurations and the evolution of enhanced system performance versus reduced system cost.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126787726","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}
Because of the high complexity of the real world, realistic simulation of natural scenes is very costly in computation. The topographical subtlety of common natural features such as trees and clouds remains a stumbling block to cost-effective computer modeling. A new scene model, composed of quadric surfaces bounded with planes and overlaid with texturing, provides an efficient and effective means of representing a wide range, of natural features. The new model provides a compact and functional data base which minimizes the number of scene elements. Efficient hidden surface algorithms for quadric surfaces bounded by planes are included. A mathematical texturing function represents natural surface detail in a statistical manner. Techniques have been developed to simulate natural scenes with the artistic efficiency of an impressionist painter.
{"title":"Simulation of natural scenes using textured quadric surfaces","authors":"G. Gardner","doi":"10.1145/800031.808572","DOIUrl":"https://doi.org/10.1145/800031.808572","url":null,"abstract":"Because of the high complexity of the real world, realistic simulation of natural scenes is very costly in computation. The topographical subtlety of common natural features such as trees and clouds remains a stumbling block to cost-effective computer modeling. A new scene model, composed of quadric surfaces bounded with planes and overlaid with texturing, provides an efficient and effective means of representing a wide range, of natural features. The new model provides a compact and functional data base which minimizes the number of scene elements. Efficient hidden surface algorithms for quadric surfaces bounded by planes are included. A mathematical texturing function represents natural surface detail in a statistical manner. Techniques have been developed to simulate natural scenes with the artistic efficiency of an impressionist painter.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121030375","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}
An algorithm is presented that solves the visible surface problem at each pixel independently. This allows motion blur and depth of field blurring to be integrated into the algorithm. It also allows parallel processing. The algorithm works on large numbers of polygons. An analytic Gaussian filter is used. The filter can be elongated or scaled differently for each polygon to adjust for its speed or distance from the focal plane. This is achieved by shrinking or scaling the polygon prior to solving the hidden surface problem so that blurring is correctly presented when objects obscure each other.
{"title":"An analytic visible surface algorithm for independent pixel processing","authors":"E. Catmull","doi":"10.1145/800031.808586","DOIUrl":"https://doi.org/10.1145/800031.808586","url":null,"abstract":"An algorithm is presented that solves the visible surface problem at each pixel independently. This allows motion blur and depth of field blurring to be integrated into the algorithm. It also allows parallel processing. The algorithm works on large numbers of polygons. An analytic Gaussian filter is used. The filter can be elongated or scaled differently for each polygon to adjust for its speed or distance from the focal plane. This is achieved by shrinking or scaling the polygon prior to solving the hidden surface problem so that blurring is correctly presented when objects obscure each other.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134301461","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}
This paper presents new algorithms to trace objects represented by densities within a volume grid, e.g. clouds, fog, flames, dust, particle systems. We develop the light scattering equations, discuss previous methods of solution, and present a new approximate solution to the full three-dimensional radiative scattering problem suitable for use in computer graphics. Additionally we review dynamical models for clouds used to make an animated movie.
{"title":"Ray tracing volume densities","authors":"J. Kajiya, B. V. Herzen","doi":"10.1145/800031.808594","DOIUrl":"https://doi.org/10.1145/800031.808594","url":null,"abstract":"This paper presents new algorithms to trace objects represented by densities within a volume grid, e.g. clouds, fog, flames, dust, particle systems. We develop the light scattering equations, discuss previous methods of solution, and present a new approximate solution to the full three-dimensional radiative scattering problem suitable for use in computer graphics. Additionally we review dynamical models for clouds used to make an animated movie.","PeriodicalId":113183,"journal":{"name":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131212889","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
扫码关注我们
求助内容：
应助结果提醒方式：