Topological structures in computer science
E. Khalimsky
- 发表年份
- 1987
- 引用次数
- 51
- 访问权限
- 开放获取
摘要
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.
关键词
相关论文
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Fractional Differential Equations
Igor Podlubný
2025
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
Genetic Programming: On the Programming of Computers by Means of Natural Selection
John R. Koza
1992