Name
Abstract | ||
|---|---|---|
A procedure is proposed which uses some basic aspects of topology for the description and encoding of arbitrary solid two-dimensional configurations. It is shown that the procedure is closely related to the octagonal chain encoding scheme for arbitrary curves. In fact, the method is shown to exhibit many of the relatively simple and hence powerful manipulative properties of the octagonal chain code. Because of its simplicity it can be most readily utilized with presentday computing equipment. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1007/BF00978375 | International Journal of Parallel Programming |
Keywords | DocType | Volume |
oriented simplexes,simplicial sentence,simplicial code.,triangulation,coherently oriented simplicial complexes,octagonal chain code,digital topology,chain code,simplicial complex | Journal | 10 |
Issue | ISSN | Citations |
1 | 1573-7640 | 2 |
PageRank | References | Authors |
0.45 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephanie M. Boyles | 1 | 11 | 2.02 |
| Gerhard X. Ritter | 2 | 353 | 41.59 |