期刊論文

學年 88
學期 1
出版(發表)日期 2000-01-01
作品名稱 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
單位 淡江大學資訊工程學系
出版者 淡江大學
著錄名稱、卷期、頁數 淡江理工學刊=Tamkang journal of science and engineering 2(4), pp.175-186
摘要 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.
關鍵字 Region filling;Y-modification test;Active edge table;Edge table;Liu's criterion
語言 en_US
ISSN 1560-6686
期刊性質 國內
收錄於
產學合作
通訊作者
審稿制度
國別 TWN
公開徵稿
出版型式 ,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45278 )

機構典藏連結