Region-filling algorithm on bincode-based contour and its implementation

摘要

Using bincodes to represent binary images is a storage-saving encoding scheme. Region filling is a classical and important operation in the fields of computer graphics. Given a contour, i.e., region boundary, represented by p bincodes with their corresponding neighbor information, this paper presents an O(p x d)-time algorithm for region filling, where d denotes the depth of the corresponding bintree of the given bincodes. Experimental results are illustrated to justify the performance of the proposed algorithm.