EconPapers    
Economics at your fingertips  
 

Topological structures in computer science

Efim Khalimsky

International Journal of Stochastic Analysis, 1987, vol. 1, 1-16

Abstract:

Topologies of finite spaces and spaces with countably many points are investigated. It is proven, using the theory of ordered topological spaces, that any topology in connected ordered spaces, with finitely many points or in spaces similar to the set of all integers, is an interval-alternating topology. Integer and digital lines, arcs, and curves are considered. Topology of N-dimensional digital spaces is described. A digital analog of the intermediate value theorem is proven. The equivalence of connectedness and pathconnectedness in digital and integer spaces is also proven. It is shown here how methods of continuous mathematics, for example, topological methods, can be applied to objects, that used to be investigated only by methods of discrete mathematics. The significance of methods and ideas in digital image and picture processing, robotic vision, computer tomography and system's sciences presented here is well known.

Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/1/921206.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/1/921206.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnijsa:921206

DOI: 10.1155/S1048953388000036

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().

 
Page updated 2025-03-19
Handle: RePEc:hin:jnijsa:921206