Centers of sets of pixels
| Title | Centers of sets of pixels |
| Publication Type | Journal Articles |
| Year of Publication | 2000 |
| Authors | Khuller S, Rosenfeld A, Wu A |
| Journal | Discrete Applied Mathematics |
| Volume | 103 |
| Issue | 1–3 |
| Pagination | 297 - 306 |
| Date Published | 2000/07/15/ |
| ISBN Number | 0166-218X |
| Keywords | Center, Chessboard distance, City block distance, Intrinsic distance, Simply connected set |
| 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. |
| URL | http://www.sciencedirect.com/science/article/pii/S0166218X99002486 |
| DOI | 10.1016/S0166-218X(99)00248-6 |