{"title":"基于斜率1的直线栅格化快速算法","authors":"Hua Zhang, Changqian Zhu, Jun Yang","doi":"10.1109/ISADS.2005.1452121","DOIUrl":null,"url":null,"abstract":"In this paper, a fast algorithm for line rasterization is presented by using approximate pixels. Slope 1 is used to decide which pixel is selected instead of using slope 1/2. Compared with Bresenham's middle point algorithm, three multiplications are reduced in each line raster process. Moreover, experiment shows that at least 6.315 percent of time is saved, and there are almost the same results for viewer compared with those of Bresenham's middle point algorithm.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fast algorithm for line rasterization by using slope 1\",\"authors\":\"Hua Zhang, Changqian Zhu, Jun Yang\",\"doi\":\"10.1109/ISADS.2005.1452121\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a fast algorithm for line rasterization is presented by using approximate pixels. Slope 1 is used to decide which pixel is selected instead of using slope 1/2. Compared with Bresenham's middle point algorithm, three multiplications are reduced in each line raster process. Moreover, experiment shows that at least 6.315 percent of time is saved, and there are almost the same results for viewer compared with those of Bresenham's middle point algorithm.\",\"PeriodicalId\":120577,\"journal\":{\"name\":\"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISADS.2005.1452121\",\"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 Autonomous Decentralized Systems, 2005. ISADS 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2005.1452121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast algorithm for line rasterization by using slope 1
In this paper, a fast algorithm for line rasterization is presented by using approximate pixels. Slope 1 is used to decide which pixel is selected instead of using slope 1/2. Compared with Bresenham's middle point algorithm, three multiplications are reduced in each line raster process. Moreover, experiment shows that at least 6.315 percent of time is saved, and there are almost the same results for viewer compared with those of Bresenham's middle point algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
