English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51258/86283 (59%)
造訪人次 : 8013460      線上人數 : 66
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    1560-6686_2-4-1.pdf331KbAdobe PDF365檢視/開啟



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