Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1145/800224.806786 | SIGGRAPH |
Keywords | Field | DocType |
Connectivity filling,Graph traversal,Parity check filling,Phototypesetting,Scan conversion,Seed filling,Shading | Adjacency list,Parity bit,Raster graphics,Scan conversion,Computer science,Theoretical computer science,Artificial intelligence,Computer vision,Graph traversal,Phototypesetting,Algorithm,Filling-in,Parity (mathematics) | Conference |
Volume | Issue | ISSN |
15 | 3 | 0097-8930 |
ISBN | Citations | PageRank |
0-89791-045-1 | 21 | 4.66 |
References | Authors | |
6 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Theo Pavlidis | 1 | 2459 | 1848.41 |