Medians of discrete sets according to a linear distance

DOI10.1007/s004540010018zbMath0960.51007OpenAlexW1967628893MaRDI QIDQ1569848

Alain Daurat, Maurice Nivat, Alberto del Lungo

Publication date: 7 May 2001

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004540010018

zbMATH Keywords

integer latticeManhattan distanceconnectivity propertymedian points of finite subsets

Mathematics Subject Classification ID

Distance geometry (51K99)

Related Items (6)

Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses ⋮ An algorithm reconstructing convex lattice sets. ⋮ A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives ⋮ Median problem in some plane triangulations and quadrangulations. ⋮ Stability in discrete tomography: some positive results ⋮ Random generation of \(Q\)-convex sets

This page was built for publication: Medians of discrete sets according to a linear distance