1987International Journal of Stochastic AnalysisOpen access

Topological structures in computer science

E. Khalimsky

Open full text 51 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 51 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Digital topology, Digital geometry, Mathematics, Topological space, Topology (electrical circuits), Social connectedness, Integer (computer science), Separated sets

Related papers

Back to paper searchBrowse research topicsOriginal source
Topological structures in computer science — Research Paper | ScholarLens