Recent advances in realtime image compression and decompression hardware make it possible for a high-performance graphics engine to operate as a rendering server in a networked environment. If the client is a low-end workstation or set-top box, then the rendering task can be split across the two devices. In this paper, we explore one strategy for doing this. For each frame, the server generates a high-quality rendering and a low-quality rendering, subtracts the two, and sends the difference in compressed form. The client generates a matching low quality rendering, adds the decompressed difference image, and displays the composite. Within this paradigm, there is wide latitude to choose what constitutes a high-quality versus low-quality rendering. We have experimented with textured versus untextured surfaces, fine versus coarse tessellation of curved surfaces, Phong versus Gouraud interpolated shading, and antialiased versus nonantialiased edges. In all cases, our polygon-assisted compression looks subjectively better for a fixed network bandwidth than compressing and sending the high-quality rendering. We describe a software simulation that uses JPEG and MPEG-1 compression, and we show results for a variety of scenes. CR Categories: I.4.2 [Computer Graphics]: Compression — Approximate methods I.3.2 [Computer Graphics]: Graphics Systems — Distributed/network graphics Additional keywords: client-server graphics, JPEG, MPEG, polygon-assisted compression
{"title":"Polygon-assisted JPEG and MPEG compression of synthetic images","authors":"M. Levoy","doi":"10.1145/218380.218392","DOIUrl":"https://doi.org/10.1145/218380.218392","url":null,"abstract":"Recent advances in realtime image compression and decompression hardware make it possible for a high-performance graphics engine to operate as a rendering server in a networked environment. If the client is a low-end workstation or set-top box, then the rendering task can be split across the two devices. In this paper, we explore one strategy for doing this. For each frame, the server generates a high-quality rendering and a low-quality rendering, subtracts the two, and sends the difference in compressed form. The client generates a matching low quality rendering, adds the decompressed difference image, and displays the composite. Within this paradigm, there is wide latitude to choose what constitutes a high-quality versus low-quality rendering. We have experimented with textured versus untextured surfaces, fine versus coarse tessellation of curved surfaces, Phong versus Gouraud interpolated shading, and antialiased versus nonantialiased edges. In all cases, our polygon-assisted compression looks subjectively better for a fixed network bandwidth than compressing and sending the high-quality rendering. We describe a software simulation that uses JPEG and MPEG-1 compression, and we show results for a variety of scenes. CR Categories: I.4.2 [Computer Graphics]: Compression — Approximate methods I.3.2 [Computer Graphics]: Graphics Systems — Distributed/network graphics Additional keywords: client-server graphics, JPEG, MPEG, polygon-assisted compression","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133795636","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 work presents a new general approach for applying textures onto implicit surfaces. Its main contributions are: An improved set of interactive tools for subdividing implicit surfaces into convenient patches. An efficient and reliable algorithm for deriving parameterizations for these patches. A new set of useful texturing operations. These results provide a unified representation scheme for a variety of texturing techniques that were previously incompatible, allowing more efficient manipulation, storage, and rendering of textured objects and a fuller use of current texture mapping hardware.
{"title":"Decorating implicit surfaces","authors":"H. Pedersen","doi":"10.1145/218380.218458","DOIUrl":"https://doi.org/10.1145/218380.218458","url":null,"abstract":"This work presents a new general approach for applying textures onto implicit surfaces. Its main contributions are: An improved set of interactive tools for subdividing implicit surfaces into convenient patches. An efficient and reliable algorithm for deriving parameterizations for these patches. A new set of useful texturing operations. These results provide a unified representation scheme for a variety of texturing techniques that were previously incompatible, allowing more efficient manipulation, storage, and rendering of textured objects and a fuller use of current texture mapping hardware.","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124990593","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. Hodgins, W. Wooten, David C. Brogan, J. F. O'Brien
This paper describes algorithms for the animation of male and female models performing three dynamic athletic behaviors: running, bicycling, and vaulting. We animate these behaviors using control algorithms that cause a physically realistic model to perform the desired maneuver. For example, control algorithms allow the simulated humans to maintain balance while moving their arms, to run or bicycle at a variety of speeds, and to perform two vaults. For each simulation, we compare the computed motion to that of humans performing similar maneuvers. We perform the comparison both qualitatively through real and simulated video images and quantitatively through simulated and biomechanical data.
{"title":"Animating human athletics","authors":"J. Hodgins, W. Wooten, David C. Brogan, J. F. O'Brien","doi":"10.1145/218380.218414","DOIUrl":"https://doi.org/10.1145/218380.218414","url":null,"abstract":"This paper describes algorithms for the animation of male and female models performing three dynamic athletic behaviors: running, bicycling, and vaulting. We animate these behaviors using control algorithms that cause a physically realistic model to perform the desired maneuver. For example, control algorithms allow the simulated humans to maintain balance while moving their arms, to run or bicycle at a variety of speeds, and to perform two vaults. For each simulation, we compare the computed motion to that of humans performing similar maneuvers. We perform the comparison both qualitatively through real and simulated video images and quantitatively through simulated and biomechanical data.","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130881230","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}
We present a method for searching in an image database using a query image that is similar to the intended target. The query image may be a hand-drawn sketch or a (potentially low-quality) scan of the image to be retrieved. Our searching algorithm makes use of multiresolution wavelet decompositions of the query and database images. The coefficients of these decompositions are distilled into small “signatures” for each image. We introduce an “image querying metric” that operates on these signatures. This metric essentially compares how many significant wavelet coefficients the query has in common with potential targets. The metric includes parameters that can be tuned, using a statistical analysis, to accommodate the kinds of image distortions found in different types of image queries. The resulting algorithm is simple, requires very little storage overhead for the database of signatures, and is fast enough to be performed on a database of 20,000 images at interactive rates (on standard desktop machines) as a query is sketched. Our experiments with hundreds of queries in databases of 1000 and 20,000 images show dramatic improvement, in both speed and success rate, over using a conventional L1, L2, or color histogram norm. CR
{"title":"Fast multiresolution image querying","authors":"Charles E. Jacobs, Adam Finkelstein, D. Salesin","doi":"10.1145/218380.218454","DOIUrl":"https://doi.org/10.1145/218380.218454","url":null,"abstract":"We present a method for searching in an image database using a query image that is similar to the intended target. The query image may be a hand-drawn sketch or a (potentially low-quality) scan of the image to be retrieved. Our searching algorithm makes use of multiresolution wavelet decompositions of the query and database images. The coefficients of these decompositions are distilled into small “signatures” for each image. We introduce an “image querying metric” that operates on these signatures. This metric essentially compares how many significant wavelet coefficients the query has in common with potential targets. The metric includes parameters that can be tuned, using a statistical analysis, to accommodate the kinds of image distortions found in different types of image queries. The resulting algorithm is simple, requires very little storage overhead for the database of signatures, and is fast enough to be performed on a database of 20,000 images at interactive rates (on standard desktop machines) as a query is sketched. Our experiments with hundreds of queries in databases of 1000 and 20,000 images show dramatic improvement, in both speed and success rate, over using a conventional L1, L2, or color histogram norm. CR","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"37 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120912708","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 proposes a new class of unit quaternion curves in 3 . A general method is developed that transforms a curve in 3 (defined as a weighted sum of basis functions) into its unit quaternion analogue in 3 . Applying the method to well-known spline curves (such as B´ ezier, Hermite, and B-spline curves), we are able to construct various unit quaternion curves which share many important differential properties with their original curves. Many of our naive common beliefs in geometry break down even in the simple non-Euclidean space 3 or 3 . For example, the de Casteljau type construction of cubic B-spline quaternion curves does not preserve 2 -continuity [10]. Through the use of decomposition into simple primitive quaternion curves, our quaternion curves preserve most of the algebraic and differential properties of the original spline curves.
{"title":"A general construction scheme for unit quaternion curves with simple high order derivatives","authors":"Myoung-Jun Kim, Myung-Soo Kim, Sung-yong Shin","doi":"10.1145/218380.218486","DOIUrl":"https://doi.org/10.1145/218380.218486","url":null,"abstract":"This paper proposes a new class of unit quaternion curves in 3 . A general method is developed that transforms a curve in 3 (defined as a weighted sum of basis functions) into its unit quaternion analogue in 3 . Applying the method to well-known spline curves (such as B´ ezier, Hermite, and B-spline curves), we are able to construct various unit quaternion curves which share many important differential properties with their original curves. Many of our naive common beliefs in geometry break down even in the simple non-Euclidean space 3 or 3 . For example, the de Casteljau type construction of cubic B-spline quaternion curves does not preserve 2 -continuity [10]. Through the use of decomposition into simple primitive quaternion curves, our quaternion curves preserve most of the algebraic and differential properties of the original spline curves.","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127226588","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}
Monte Carlo integration is a powerful technique for the evaluation of difficult integrals. Applications in rendering include distribution ray tracing, Monte Carlo path tracing, and form-factor computation for radiosity methods. In these cases variance can often be significantly reduced by drawing samples from several distributions, each designed to sample well some difficult aspect of the integrand. Normally this is done by explicitly partitioning the integration domain into regions that are sampled differently. We present a powerful alternative for constructing robust Monte Carlo estimators, by combining samples from several distributions in a way that is provably good. These estimators are unbiased, and can reduce variance significantly at little additional cost. We present experiments and measurements from several areas in rendering: calculation of glossy highlights from area light sources, the “final gather” pass of some radiosity algorithms, and direct solution of the rendering equation using bidirectional path tracing. CR Categories: I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism; I.3.3 [Computer Graphics]: Picture/Image Generation; G.1.9 [Numerical Analysis]: Integral Equations— Fredholm equations. Additional
{"title":"Optimally combining sampling techniques for Monte Carlo rendering","authors":"Eric Veach, L. Guibas","doi":"10.1145/218380.218498","DOIUrl":"https://doi.org/10.1145/218380.218498","url":null,"abstract":"Monte Carlo integration is a powerful technique for the evaluation of difficult integrals. Applications in rendering include distribution ray tracing, Monte Carlo path tracing, and form-factor computation for radiosity methods. In these cases variance can often be significantly reduced by drawing samples from several distributions, each designed to sample well some difficult aspect of the integrand. Normally this is done by explicitly partitioning the integration domain into regions that are sampled differently. We present a powerful alternative for constructing robust Monte Carlo estimators, by combining samples from several distributions in a way that is provably good. These estimators are unbiased, and can reduce variance significantly at little additional cost. We present experiments and measurements from several areas in rendering: calculation of glossy highlights from area light sources, the “final gather” pass of some radiosity algorithms, and direct solution of the rendering equation using bidirectional path tracing. CR Categories: I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism; I.3.3 [Computer Graphics]: Picture/Image Generation; G.1.9 [Numerical Analysis]: Integral Equations— Fredholm equations. Additional","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132709461","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}
Wedevelop a clustereddithering method that uses stochastic screening and is able to perform an adaptive variation of the cluster size. This makes it possible to achieve optimal rendition of gray shades while preserving image details. The algorithm is an improvement to the dithering with space filling curves method, published in [3]. CR Descriptors: B.4.2 [Input/Output and Data Communications]: Input-Output Devices Image Display; I.3.3 [Computer Graphics]: Picture/image generation Display algorithms; I.3.6 [Computer Graphics]: Methodology and Techniques; I.4.3 [Image Processing]: Enhancement. Additional
{"title":"Stochastic screening dithering with adaptive clustering","authors":"L. Velho, J. Gomes","doi":"10.1145/218380.218452","DOIUrl":"https://doi.org/10.1145/218380.218452","url":null,"abstract":"Wedevelop a clustereddithering method that uses stochastic screening and is able to perform an adaptive variation of the cluster size. This makes it possible to achieve optimal rendition of gray shades while preserving image details. The algorithm is an improvement to the dithering with space filling curves method, published in [3]. CR Descriptors: B.4.2 [Input/Output and Data Communications]: Input-Output Devices Image Display; I.3.3 [Computer Graphics]: Picture/image generation Display algorithms; I.3.6 [Computer Graphics]: Methodology and Techniques; I.4.3 [Image Processing]: Enhancement. Additional","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134264437","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}
Image-based rendering is a powerful new approach for generating real-time photorealistic computer graphics. It can provide convincing animations without an explicit geometric representation. We use the "plenoptic function" of Adelson and Bergen to provide a concise problem statement for image-based rendering paradigms, such as morphing and view interpolation. The plenoptic function is a parameterized function for describing everything that is visible from a given point in space. We present an image-based rendering system based on sampling, reconstructing, and resampling the plenoptic function. In addition, we introduce a novel visible surface algorithm and a geometric invariant for cylindrical projections that is equivalent to the epipolar constraint defined for planar projections.
{"title":"Plenoptic modeling: an image-based rendering system","authors":"L. McMillan, G. Bishop","doi":"10.1145/218380.218398","DOIUrl":"https://doi.org/10.1145/218380.218398","url":null,"abstract":"Image-based rendering is a powerful new approach for generating real-time photorealistic computer graphics. It can provide convincing animations without an explicit geometric representation. We use the \"plenoptic function\" of Adelson and Bergen to provide a concise problem statement for image-based rendering paradigms, such as morphing and view interpolation. The plenoptic function is a parameterized function for describing everything that is visible from a given point in space. We present an image-based rendering system based on sampling, reconstructing, and resampling the plenoptic function. In addition, we introduce a novel visible surface algorithm and a geometric invariant for cylindrical projections that is equivalent to the epipolar constraint defined for planar projections.","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132071441","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 this paper we introduce a new approach to controlling error in hierarchical clustering algorithms for radiosity. The new method provides control mechanisms which attempt to ensure that just enough work is done to meet the user's quality criteria. To this end the importance of traditionally ignored visibility error is identified, and the concept of {it features} is introduced as a way to evaluate the quality of an image. A methodology to evaluate error based on features is presented, which leads to the development of a {it multi-resolution visibility} algorithm. An algorithm to construct a suitable hierarchy for clustering and multi-resolution visibility is also proposed. Results of the implementation show that the multi-resolution approach has the potential of providing significant computational savings depending on the choice of feature size the user is interested in. They also illustrate the relevance of the feature-based error analysis. The proposed algorithms are well suited to the development of interactive lighting simulation systems since they allow more user control. Two additional mechanisms to control the quality of a simulation are presented: The evaluation of internal visibility in a cluster produces more accurate solutions for a given error bound; A progressive multi-gridding approach is introduced for hierarchical radiosity, allowing continuous refinement of a solution in an interactive session.
{"title":"Feature-based control of visibility error: a multi-resolution clustering algorithm for global illumination","authors":"F. Sillion, G. Drettakis","doi":"10.1145/218380.218434","DOIUrl":"https://doi.org/10.1145/218380.218434","url":null,"abstract":"In this paper we introduce a new approach to controlling error in hierarchical clustering algorithms for radiosity. The new method provides control mechanisms which attempt to ensure that just enough work is done to meet the user's quality criteria. To this end the importance of traditionally ignored visibility error is identified, and the concept of {it features} is introduced as a way to evaluate the quality of an image. A methodology to evaluate error based on features is presented, which leads to the development of a {it multi-resolution visibility} algorithm. An algorithm to construct a suitable hierarchy for clustering and multi-resolution visibility is also proposed. Results of the implementation show that the multi-resolution approach has the potential of providing significant computational savings depending on the choice of feature size the user is interested in. They also illustrate the relevance of the feature-based error analysis. The proposed algorithms are well suited to the development of interactive lighting simulation systems since they allow more user control. Two additional mechanisms to control the quality of a simulation are presented: The evaluation of internal visibility in a cluster produces more accurate solutions for a given error bound; A progressive multi-gridding approach is introduced for hierarchical radiosity, allowing continuous refinement of a solution in an interactive session.","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121375959","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}
Encarnacao for leudershtp in applied research using computer graphics for a broad range of industrial and medical applicntmns. in international graphics standards and in computer graphtcs education. His work in computer graphics began at the Tcchmcal Umvcrstty of Berl in tn 1967 when hc was also associated with the Hcinrich Hertz Institute. In the period 1972-75 hc wxs ;lt the University of Saarbrtickcn. In 1975 hc became Professor at the Technical University of Darmstadt. an appointment he holds today. His earliest work involved dcvelopmcnt of basic algorithms such as hidden-line elimination and hardware for matrtx manipulations (4 by 4). The Encarna$io Scan-Grid Hidden Surface algorithm was particularly appropriate for surface representations used in CAD applications for car body design. It was during this period he became concerned with graphics systems applied to computer aided design-early evidence of his long-term commitment to technology transfer between academia and industry. a hallmark of the German and European technical communities. His efforts in standards are consistent with that commitment. Starting in 1970, Encarnacao lead successful efforts at Standardization in Computer Graphics in Germany. He convened experts from all over Germany and involved many from the group of researchers he had assembled in Darmstadt. He has been especially active in DIN and IS0 standards, and was a primary contributor to the GKS graphics standard. He participated in the celebrated meetings at the Chateau Seillac in 1976 that led to the Proposed Core Standard put forth by SIGCRAPH. Recognizing at that time the need for a practical 2D system, he spearheaded the effort to produce the Graphical Kernel System, GKS, an extensive elaboration of an early version of the 3D Core proposals. Subsequently, under Encarna@o’s direction, Gi inter Pfaff et al developed a GKS implementation at Darmstadt that became the leading commercial product of its kind and remains in use in German CAD and other graphics application systems. As a professor specializing in computer graphics for more than twenty years, Dr. Encarnaqlo has been the advisor for more than forty Ph.D. students, many of whom have themselves attained professorial positions. To ensure the stability of Computer Graphics in academic computer science and in industry he initially established the Interactive Graphics Research Group (THD-GRIS) in 1975 at the Technical University of Darmstadt. In 1984 he also founded, and became chairman of the board, of the Computer Graphics Center (ZGDV). In addition to the main laboratory in Darmstadt, it now has associated laboratories in Restock and in 1995 ACM SIGGRAPH Awards
{"title":"Steven A. Coons award for outstanding creative contributions to computer graphics","authors":"J. Encarnação","doi":"10.1145/218380.218388","DOIUrl":"https://doi.org/10.1145/218380.218388","url":null,"abstract":"Encarnacao for leudershtp in applied research using computer graphics for a broad range of industrial and medical applicntmns. in international graphics standards and in computer graphtcs education. His work in computer graphics began at the Tcchmcal Umvcrstty of Berl in tn 1967 when hc was also associated with the Hcinrich Hertz Institute. In the period 1972-75 hc wxs ;lt the University of Saarbrtickcn. In 1975 hc became Professor at the Technical University of Darmstadt. an appointment he holds today. His earliest work involved dcvelopmcnt of basic algorithms such as hidden-line elimination and hardware for matrtx manipulations (4 by 4). The Encarna$io Scan-Grid Hidden Surface algorithm was particularly appropriate for surface representations used in CAD applications for car body design. It was during this period he became concerned with graphics systems applied to computer aided design-early evidence of his long-term commitment to technology transfer between academia and industry. a hallmark of the German and European technical communities. His efforts in standards are consistent with that commitment. Starting in 1970, Encarnacao lead successful efforts at Standardization in Computer Graphics in Germany. He convened experts from all over Germany and involved many from the group of researchers he had assembled in Darmstadt. He has been especially active in DIN and IS0 standards, and was a primary contributor to the GKS graphics standard. He participated in the celebrated meetings at the Chateau Seillac in 1976 that led to the Proposed Core Standard put forth by SIGCRAPH. Recognizing at that time the need for a practical 2D system, he spearheaded the effort to produce the Graphical Kernel System, GKS, an extensive elaboration of an early version of the 3D Core proposals. Subsequently, under Encarna@o’s direction, Gi inter Pfaff et al developed a GKS implementation at Darmstadt that became the leading commercial product of its kind and remains in use in German CAD and other graphics application systems. As a professor specializing in computer graphics for more than twenty years, Dr. Encarnaqlo has been the advisor for more than forty Ph.D. students, many of whom have themselves attained professorial positions. To ensure the stability of Computer Graphics in academic computer science and in industry he initially established the Interactive Graphics Research Group (THD-GRIS) in 1975 at the Technical University of Darmstadt. In 1984 he also founded, and became chairman of the board, of the Computer Graphics Center (ZGDV). In addition to the main laboratory in Darmstadt, it now has associated laboratories in Restock and in 1995 ACM SIGGRAPH Awards","PeriodicalId":447770,"journal":{"name":"Proceedings of the 22nd annual conference on Computer graphics and interactive techniques","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114569316","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
扫码关注我们
求助内容：
应助结果提醒方式：