{"title":"光栅图形的两步填充算法","authors":"A. Distante, N. Veneziani","doi":"10.1016/0146-664X(82)90087-9","DOIUrl":null,"url":null,"abstract":"<div><p>An algorithm for filling irregular polygons is presented. It is designed to operate in raster mode and uses the refresh memory of a graphic display as working space. The algorithm has been implemented in a host computer but it can be implemented easily within the microprocessor controlling the display. All areas contoured by closed lines are shaded at the same time according to a preassigned color code.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Pages 288-295"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90087-9","citationCount":"0","resultStr":"{\"title\":\"A two-pass filling algorithm for raster graphics\",\"authors\":\"A. Distante, N. Veneziani\",\"doi\":\"10.1016/0146-664X(82)90087-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>An algorithm for filling irregular polygons is presented. It is designed to operate in raster mode and uses the refresh memory of a graphic display as working space. The algorithm has been implemented in a host computer but it can be implemented easily within the microprocessor controlling the display. All areas contoured by closed lines are shaded at the same time according to a preassigned color code.</p></div>\",\"PeriodicalId\":100313,\"journal\":{\"name\":\"Computer Graphics and Image Processing\",\"volume\":\"20 3\",\"pages\":\"Pages 288-295\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0146-664X(82)90087-9\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Graphics and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0146664X82900879\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0146664X82900879","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An algorithm for filling irregular polygons is presented. It is designed to operate in raster mode and uses the refresh memory of a graphic display as working space. The algorithm has been implemented in a host computer but it can be implemented easily within the microprocessor controlling the display. All areas contoured by closed lines are shaded at the same time according to a preassigned color code.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
