An edge-list compression scheme for 2-D graphic system

Yun-Nan Chang, Ting-Chi Tong
{"title":"An edge-list compression scheme for 2-D graphic system","authors":"Yun-Nan Chang, Ting-Chi Tong","doi":"10.1109/MWSCAS.2010.5548742","DOIUrl":null,"url":null,"abstract":"This paper presents an edge-list compression scheme for the two-dimensional (2D) graphic systems. To fill a 2D graphic object described by complex curve paths, either enormous global edge-table has to be created, or a more economic line-based edge-list can be utilized. The latter approach, however, will sacrifice the rendering quality by approximating the curve using straight-lines. Therefore, this paper proposes a new edge-list structure, which first divides each path of the object into several upward and downward segments. Each segment will then be coded based on the difference vector of neighboring pixels, and the quadrant this vector belongs to. The entire path can be converted into a compact bit-stream. To decode the bit-stream, an additional link-list structure has to be built, which contains the direct access links to the entry points in the bit-stream in order to fetch the local lowest points to produce an active edge-list for each scan line. Our preliminary results show that the proposed scheme can reduce the overall edge-table size by an average factor of 15.","PeriodicalId":245322,"journal":{"name":"2010 53rd IEEE International Midwest Symposium on Circuits and Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 53rd IEEE International Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.2010.5548742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents an edge-list compression scheme for the two-dimensional (2D) graphic systems. To fill a 2D graphic object described by complex curve paths, either enormous global edge-table has to be created, or a more economic line-based edge-list can be utilized. The latter approach, however, will sacrifice the rendering quality by approximating the curve using straight-lines. Therefore, this paper proposes a new edge-list structure, which first divides each path of the object into several upward and downward segments. Each segment will then be coded based on the difference vector of neighboring pixels, and the quadrant this vector belongs to. The entire path can be converted into a compact bit-stream. To decode the bit-stream, an additional link-list structure has to be built, which contains the direct access links to the entry points in the bit-stream in order to fetch the local lowest points to produce an active edge-list for each scan line. Our preliminary results show that the proposed scheme can reduce the overall edge-table size by an average factor of 15.
二维图形系统的边表压缩方案
提出了一种二维图形系统的边表压缩方案。要填充由复杂曲线路径描述的二维图形对象,要么必须创建庞大的全局边表,要么可以使用更经济的基于线的边表。然而,后一种方法将通过使用直线近似曲线来牺牲渲染质量。为此,本文提出了一种新的边表结构,该结构首先将目标的每条路径划分为几个向上和向下的段。然后根据相邻像素的差向量和该向量所属的象限对每个段进行编码。整个路径可以转换成一个紧凑的比特流。为了解码比特流,必须建立一个额外的链表结构,它包含到比特流入口点的直接访问链接,以便获取本地最低点,为每个扫描线生成活动边表。我们的初步结果表明,该方案可以将边缘表的整体大小平均减少15倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信