{"title":"拓扑颜色空间的抗混叠","authors":"Ken Turkowski","doi":"10.1145/15922.15920","DOIUrl":null,"url":null,"abstract":"The power of a color space to perform well in interpolation problems such as anti-aliasing and smooth-shading is dependent on the topology of the color space as well as the number of elements it contains.We develop the Major-minor color space, which has a topology and representation that lends itself to simple anti-aliasing computations between elements of an arbitrary set of colors in an inexpensive frame store.","PeriodicalId":20524,"journal":{"name":"Proceedings of the 13th annual conference on Computer graphics and interactive techniques","volume":"57 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"1986-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Anti-aliasing in topological color spaces\",\"authors\":\"Ken Turkowski\",\"doi\":\"10.1145/15922.15920\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The power of a color space to perform well in interpolation problems such as anti-aliasing and smooth-shading is dependent on the topology of the color space as well as the number of elements it contains.We develop the Major-minor color space, which has a topology and representation that lends itself to simple anti-aliasing computations between elements of an arbitrary set of colors in an inexpensive frame store.\",\"PeriodicalId\":20524,\"journal\":{\"name\":\"Proceedings of the 13th annual conference on Computer graphics and interactive techniques\",\"volume\":\"57 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 13th annual conference on Computer graphics and interactive techniques\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/15922.15920\",\"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 13th annual conference on Computer graphics and interactive techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/15922.15920","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The power of a color space to perform well in interpolation problems such as anti-aliasing and smooth-shading is dependent on the topology of the color space as well as the number of elements it contains.We develop the Major-minor color space, which has a topology and representation that lends itself to simple anti-aliasing computations between elements of an arbitrary set of colors in an inexpensive frame store.