Medians of discrete sets according to a linear distance (Q1569848)

The authors provide a local characterization of median points of finite subsets of the integer lattice endowed with a distance that generalizes the Manhattan distance, and use it to devise a method for finding the median points. Discrete sets having a certain connectivity property are shown to contain their median points, whereas those having another connectivity property are shown to have at most four median points, and if there are four median points then they form a parallelogram.