Jeong-Joon Yoo, Seung-Won Lee, Seokyoon Jung, Shihwa Lee
{"title":"为矢量图形最小化虚假重叠的平铺分割算法","authors":"Jeong-Joon Yoo, Seung-Won Lee, Seokyoon Jung, Shihwa Lee","doi":"10.1109/ICCE.2013.6486775","DOIUrl":null,"url":null,"abstract":"In this paper, we present an efficient tile binning algorithm that reduces false overlap area for the Bezier curve. To do so, we propose a Multiple-Bounding Box (MBB) enclosing a Bezier curve with multiple bounding boxes. Experimental comparisons of MBB and legacy methods show that the proposed MBB method reduces 16~35% memory overhead. It also reduces 23~54% CPU latency overhead in a tile-based 2D graphics pipeline.","PeriodicalId":6432,"journal":{"name":"2013 IEEE International Conference on Consumer Electronics (ICCE)","volume":"14 1","pages":"17-18"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Tile binning algorithm for vector graphics minimizing false overlap\",\"authors\":\"Jeong-Joon Yoo, Seung-Won Lee, Seokyoon Jung, Shihwa Lee\",\"doi\":\"10.1109/ICCE.2013.6486775\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an efficient tile binning algorithm that reduces false overlap area for the Bezier curve. To do so, we propose a Multiple-Bounding Box (MBB) enclosing a Bezier curve with multiple bounding boxes. Experimental comparisons of MBB and legacy methods show that the proposed MBB method reduces 16~35% memory overhead. It also reduces 23~54% CPU latency overhead in a tile-based 2D graphics pipeline.\",\"PeriodicalId\":6432,\"journal\":{\"name\":\"2013 IEEE International Conference on Consumer Electronics (ICCE)\",\"volume\":\"14 1\",\"pages\":\"17-18\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Consumer Electronics (ICCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCE.2013.6486775\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Consumer Electronics (ICCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCE.2013.6486775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tile binning algorithm for vector graphics minimizing false overlap
In this paper, we present an efficient tile binning algorithm that reduces false overlap area for the Bezier curve. To do so, we propose a Multiple-Bounding Box (MBB) enclosing a Bezier curve with multiple bounding boxes. Experimental comparisons of MBB and legacy methods show that the proposed MBB method reduces 16~35% memory overhead. It also reduces 23~54% CPU latency overhead in a tile-based 2D graphics pipeline.