Centers of sets of pixels

Samir Khuller*, Azriel Rosenfeld, Angela Wu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

The center of a connected graph G is the set of nodes of G for which the maximum distance to any other node of G is as small as possible. If G is a simply connected set of lattice points ("pixels") with graph structure defined by 4-neighbor adjacency, we show that the center of G is either a 2×2 square block, a diagonal staircase, or a (dotted) diagonal line with no gaps.

Original languageEnglish (US)
Pages (from-to)297-306
Number of pages10
JournalDiscrete Applied Mathematics
Volume103
Issue number1-3
DOIs
StatePublished - Jul 15 2000

Keywords

  • Center
  • Chessboard distance
  • City block distance
  • Intrinsic distance
  • Simply connected set

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Centers of sets of pixels'. Together they form a unique fingerprint.

Cite this