# Boundaries in Digital Planes

@inproceedings{Khalimsky1990BoundariesID, title={Boundaries in Digital Planes}, author={Efim Khalimsky and Ralph Kopperman and Paul R. Meyer}, year={1990} }

The importance of topological connectedness properties in processing digital pictures is well known. A natural way to begin a theory for this is to give
a definition of connectedness for subsets of a digital plane which allows one
to prove a Jordan curve theorem. The generally accepted approach to this
has been a non-topological Jordan curve theorem which requires two different definitions, 4-connectedness, and 8-connectedness, one for the curve and
the other for its complement.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 39 CITATIONS

## The Topological Complexity of Spaces of Digital Jordan Curves

VIEW 4 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## A New Split and Merge Algorithm with Topological

VIEW 12 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Galois connections between sets of paths and closure operators in simple graphs

VIEW 1 EXCERPT

CITES BACKGROUND

## Structuring Digital Plane by the 8-Adjacency Graph with a Set of Walks

VIEW 1 EXCERPT

CITES BACKGROUND

## On Links between Rough Sets and Digital Topology

VIEW 1 EXCERPT

CITES BACKGROUND

## Optimization of WSNs Flooding Rates by Khalimsky Topology

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS