淡江大學機構典藏:Item 987654321/45278
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64178/96951 (66%)
Visitors : 10558281      Online Users : 19779
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45278


    Title: A New polygon based algorithm for filling regions
    Authors: 劉虎城;Liu, Hoo-cheng;Chen, Mu-hwa;Hsu, Shou-yiing;Chien, Chaoyin;Kuo, Tsu-feng;Wang, Yih-farn
    Contributors: 淡江大學資訊工程學系
    Keywords: Region filling;Y-modification test;Active edge table;Edge table;Liu's criterion
    Date: 2000-01
    Issue Date: 2010-03-26 18:55:12 (UTC+8)
    Publisher: 淡江大學
    Abstract: 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.
    Relation: 淡江理工學刊=Tamkang journal of science and engineering 2(4), pp.175-186
    DOI: 10.6180/jase.1999.2.4.01
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    0KbUnknown307View/Open
    1560-6686_2-4-1.pdf331KbAdobe PDF525View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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