Digital Jordan curves — a graph-theoretical approach to a topological theorem
✍ Scribed by Victor Neumann-Lara; Richard G. Wilson
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 388 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0166-8641
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The closure operations on Z × Z introduced and studied in the paper generalize the Khalimsky topology, which is commonly used as a basic topological structure in digital topology nowadays. By proving a digital analogy of the Jordan curve theorem for these closure operations, we show that they are al
A new method for analyzing the structure of a complex reaction network is proposed using a graph theoretical approach. The structural relation of chemical reactions and species in the network can be determined by a corresponding bipartite graph, and vice versa. Differential equations for the network
We present a proof of Siegel's theorem on integral points on affine curves, through the Schmidt subspace theorem, rather than Roth's theorem. This approach allows one to work only on curves, avoiding the embedding into Jacobians and the subsequent use of tools from the arithmetic of Abelian varietie