TY - JOUR
T1 - Centers of sets of pixels
JF - Discrete Applied Mathematics
Y1 - 2000
A1 - Khuller, Samir
A1 - Rosenfeld,Azriel
A1 - Wu,Angela
KW - Center
KW - Chessboard distance
KW - City block distance
KW - Intrinsic distance
KW - Simply connected set
AB - 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.
VL - 103
SN - 0166-218X
UR - http://www.sciencedirect.com/science/article/pii/S0166218X99002486
CP - 1–3
M3 - 10.1016/S0166-218X(99)00248-6
ER -