Math 2.0

Computer science Definition

Digital topology

Builds on GraphConnected component

Definition

Let p=(p1,p2)p = (p_1, p_2) and q=(q1,q2)q = (q_1, q_2) be distinct points of ℤ2\Z^2.

  1. pp and qq are 44-adjacent if ∣p1−q1∣+∣p2−q2∣=1\abs{p_1 - q_1} + \abs{p_2 - q_2} = 1.
  2. pp and qq are 88-adjacent if max⁡(∣p1−q1∣,∣p2−q2∣)=1\max(\abs{p_1 - q_1}, \abs{p_2 - q_2}) = 1.
  3. For k∈{4,8}k \in \set{4, 8}, a kk-path in a set S⊆ℤ2S \subseteq \Z^2 is a finite sequence of points of SS in which consecutive points are kk-adjacent.
  4. SS is kk-connected if any two points of SS are joined by a kk-path in SS; the maximal kk-connected subsets of SS are its kk-components.

Digital topology is the study of such adjacency, connectedness and separation notions on ℤ2\Z^2 and their analogues on ℤn\Z^n. For each kk, the kk-adjacency makes SS a graph whose connected components are the kk-components of SS.

Remarks

Example: S={(0,0),(1,1)}S = \set{(0, 0), (1, 1)} is 88-connected, since the two points are 88-adjacent. Non-example: the same SS is not 44-connected, because ∣0−1∣+∣0−1∣=2\abs{0 - 1} + \abs{0 - 1} = 2 and SS has no other points. Let S={(1,0),(0,1),(−1,0),(0,−1)}S = \set{(1, 0), (0, 1), (-1, 0), (0, -1)}. With 88-adjacency for ℤ2∖S\Z^2 \setminus S, the point (0,0)(0, 0) is 88-adjacent to (1,1)∈ℤ2∖S(1, 1) \in \Z^2 \setminus S, so the complement is 88-connected and the "curve" SS encloses nothing. With 44-adjacency for the complement, (0,0)(0, 0) is a 44-component by itself, so SS separates it from the outside. For this reason one pairs 88-adjacency for a set with 44-adjacency for its complement, or the reverse. The Khalimsky topology on ℤ\Z is a genuine topology: the sets {2n+1}\set{2n + 1} and {2n−1,2n,2n+1}\set{2n - 1, 2n, 2n + 1} for n∈ℤn \in \Z form a base, and ℤ\Z is connected in it.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Graph concept
  2. Graph definition
  3. Walk definition
  4. Reachability definition
  5. Connected component definition
  6. Digital topology definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Digital_topology
About this page
TagGH2SFDQNAE
URIm2://GH2SFDQNAE
Kinddefinition
WritingW0 stub
MSC68U03, 68U10
DefinesDigital topology
UsesGraph, Connected component
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.