Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
Digital Picture Processing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
How to color in a coloring book
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
An algorithm for shading of regions on vector display devices
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Filling regions in binary raster images: A graph-theoretic approach
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Data structures for picture processing
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Efficient polygon-filling algorithms for raster displays
ACM Transactions on Graphics (TOG)
Real-time robot motion planning using rasterizing computer graphics hardware
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Parallel polygon scan conversion on hypercube multiprocessors
Proceedings of the 1999 ACM symposium on Applied computing
Projection filling based on contour structural points
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
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
| Hi-index | 0.00 |
The paper discusses algorithms for filling contours in raster graphics. Its major feature is the use of the line adjacency graph for the contour in order to fill correctly nonconvex and multiply connected regions, while starting from a “seed.” Because the same graph is used for a “parity check” filling algorithm, the two types of algorithms can be combined into one. This combination is useful for either finding a seed through a parity check, or for resolving ambiguities in parity on the basis of connectivity.