Topological structures in computer science
暂无分享,去创建一个
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.
[1] Marvin J. Greenberg. Lectures on algebraic topology , 1967 .
[2] Azriel Rosenfeld,et al. Arcs and Curves in Digital Pictures , 1973, JACM.
[3] Sargur N. Srihari,et al. Boundary Detection in Multidimensions , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.