Skip to main content
SpringerLink
Log in

The encoding of arbitrary two-dimensional geometric configurations

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Freeman, “On the encoding to arbitrary geometric configurations,”IRE Trans. Electron. Comput. 10:260–268 (1961).

    Google Scholar 

  2. M. Henle,A Combinatorial Introduction to Topology (W. H. Freeman, San Francisco, 1979).

    Google Scholar 

  3. E. C. Hudson,Piecewise Linear Topology (W. A. Benjamin, New York, 1969).

    Google Scholar 

  4. C. R. F. Maunder,Algebraic Topology (Van Nostrand Reinhold, London, 1970).

    Google Scholar 

  5. G. Ritter and J. Tou, “The encoding of surfaces in three dimensions,” CIR Technical Report (University of Florida, Gainesville, 1980).

    Google Scholar 

  6. A. Rosenfeld, “Arcs and curves in digital pictures,”J. Assoc. Comput. Mach. 20:81–87 (1973).

    Google Scholar 

  7. A. Rosenfeld, “Digital straight line segments,”IEEE Trans. Comput. 23:1264–1269 (1974).

    Google Scholar 

  8. A. Rosenfeld, “Geodesics in digital pictures,”Inform. Control 36:74–84 (1978).

    Google Scholar 

  9. R. Stefanelli and A. Rosenfeld, “Some parallel thinning algorithms for digital pictures,”J. Assoc. Comput. Mach. 18:255–264 (1971).

    Google Scholar 

  10. J. Tou,Image Processing, Mimeographed Lecture Notes (Center for Information Research, University of Florida, Gainesville, 1979).

    Google Scholar 

  11. E. C. Zeeman,Seminar on Combinatorial Topology (Institut des Hautes Études Scientifique, Paris, 1963).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Information Research, University of Florida, 32601, Gainesville, Florida

    Stephanie M. Boyles

  2. Center for Information Research and Department of Mathematics, University of Florida, 32601, Gainesville, Florida

    Gerhard X. Ritter

Authors
  1. Stephanie M. Boyles
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerhard X. Ritter
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Center for Information Research, University of Florida, Gainesville.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boyles, S.M., Ritter, G.X. The encoding of arbitrary two-dimensional geometric configurations. International Journal of Computer and Information Sciences 10, 1–25 (1981). https://doi.org/10.1007/BF00978375

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00978375

Key words

Search

Navigation