{"title":"独立像素处理的解析可见曲面算法","authors":"E. Catmull","doi":"10.1145/800031.808586","DOIUrl":null,"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.0000,"publicationDate":"1984-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"70","resultStr":"{\"title\":\"An analytic visible surface algorithm for independent pixel processing\",\"authors\":\"E. Catmull\",\"doi\":\"10.1145/800031.808586\",\"DOIUrl\":null,\"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.0000,\"publicationDate\":\"1984-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"70\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th annual conference on Computer graphics and interactive techniques\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800031.808586\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th annual conference on Computer graphics and interactive techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800031.808586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An analytic visible surface algorithm for independent pixel processing
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.