The medians of discrete sets
From MaRDI portal
Publication:293267
DOI10.1016/S0020-0190(98)00020-9zbMath1338.68261OpenAlexW2046274683MaRDI QIDQ293267
Renzo Pinzani, Maurice Nivat, L. Sorri, Alberto del Lungo
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000209?np=y
projectionscombinatorial problemscomputational geometrydiscrete setspolyominoesmedians4-connected setsManhattan metric
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)
Related Items (3)
On finding medians of weighted discrete points ⋮ Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses ⋮ Median problem in some plane triangulations and quadrangulations.
Cites Work
- Medians and centres of polyominoes
- Reconstructing convex polyominoes from horizontal and vertical projections
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- Tiling with polyominoes and combinatorial group theory
- A method for the enumeration of various classes of column-convex polygons
- Tiling with polyominoes
- Unnamed Item
- Unnamed Item
This page was built for publication: The medians of discrete sets
