A new and fast contour-filling algorithm

Authors:
Mingwu Ren;Wankou Yang;Jingyu Yang
Affiliations:
Department of Computer Science, Nanjing University of Science and Technology, Nanjing 210094, China;Department of Computer Science, Nanjing University of Science and Technology, Nanjing 210094, China;Department of Computer Science, Nanjing University of Science and Technology, Nanjing 210094, China
Venue:
Pattern Recognition
Year:
2005

Citing 9
Cited 3

Region filing with the use of the discrete green theorem

Computer Vision, Graphics, and Image Processing
Restoration of binary images using contour direction chain codes description

Computer Vision, Graphics, and Image Processing
A fast algorithm for the restoration of images based on chain codes description and its applications

Computer Vision, Graphics, and Image Processing
An improved fast algorithm for the restoration of images based on chain codes description

CVGIP: Graphical Models and Image Processing
Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
Representation of contours and regions for efficient computer search

Communications of the ACM
Algorithms for Graphics and Imag

Algorithms for Graphics and Imag
Filling regions in binary raster images: A graph-theoretic approach

SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
The edge flag algorithm: a fill method for raster scan displays

IEEE Transactions on Computers

A new contour filling algorithm based on 2D topological map

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
A novel 3D morphing approach for tooth occlusal surface reconstruction

Computer-Aided Design
Directional difference chain codes with quasi-lossless compression and run-length encoding

Image Communication

Quantified Score

Hi-index	0.01

Visualization

Abstract

Contour filling is one of the most common problems in image and graphics processing. The executing speed of the contour filling is vital, especially for a real-time system. This paper studies the advantages and disadvantages of the conventional filling algorithms, analyzes their original ideas, and proposes a new filling algorithm. The new algorithm presents a very simple idea for finding seeds automatically, and limits the scan within the filling regions. Repeated experiments have proven that with the new algorithm, any complex inner and outer contours can be filled with higher speed.