淡江大學機構典藏:Item 987654321/45278
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62822/95882 (66%)
造访人次 : 4013851      在线人数 : 884
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45278


    题名: A New polygon based algorithm for filling regions
    作者: 劉虎城;Liu, Hoo-cheng;Chen, Mu-hwa;Hsu, Shou-yiing;Chien, Chaoyin;Kuo, Tsu-feng;Wang, Yih-farn
    贡献者: 淡江大學資訊工程學系
    关键词: Region filling;Y-modification test;Active edge table;Edge table;Liu's criterion
    日期: 2000-01
    上传时间: 2010-03-26 18:55:12 (UTC+8)
    出版者: 淡江大學
    摘要: Region filling is a fundamental operation in computer graphics and image processing. There are broadly two classes of region filling: polygon based and pixel based. The conventional polygon based region filling algorithm typically uses data structures of records and fields. Using these data structures, the region filling process slows down because of the time-consuming operations of records and fields. This paper proposes a new polygon based region filling algorithm by using the proposed data structures of triples. This results in use of more efficient triple operations involving arrays and elements to fill a region. Using data structures of triples, the y-coordinate modification problem that occurs in the conventional algorithm simply disappears. In addition, contrary to the conventional approach, which uses troublesome geometrical considerations in deciding the even number of elements in each linked list, the proposed triple model uses a simple criterion to meet the even number requirement. Most important of all is the fact that the proposed criterion is independent of the polygon geometry. The experimental results strongly support superiority of the proposed algorithm. It is verified that the proposed algorithm is both theoretically and experimentally better than the conventional algorithm.
    關聯: 淡江理工學刊=Tamkang journal of science and engineering 2(4), pp.175-186
    DOI: 10.6180/jase.1999.2.4.01
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    0KbUnknown261检视/开启
    1560-6686_2-4-1.pdf331KbAdobe PDF461检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈