On the reconstruction of planar lattice-convex sets from the covariogram

Details On the reconstruction of planar lattice-convex sets from the covariogram On the reconstruction of planar lattice-convex sets from the covariogram

2010-11-24

arxiv.org/abs/1011.5530v3

Mathematics

Metric Geometry

accepted in Discrete and Computational Geometry

Scientific paper

10.1007/s00454-012-9416-6

A finite subset $K$ of $\mathbb{Z}^d$ is said to be lattice-convex if $K$ is the intersection of $\mathbb{Z}^d$ with a convex set. The covariogram $g_K$ of $K\subseteq \mathbb{Z}^d$ is the function associating to each $u \in \integer^d$ the cardinality of $K\cap (K+u)$. Daurat, G\'erard, and Nivat and independently Gardner, Gronchi, and Zong raised the problem on the reconstruction of lattice-convex sets $K$ from $g_K$. We provide a partial positive answer to this problem by showing that for $d=2$ and under mild extra assumptions, $g_K$ determines $K$ up to translations and reflections. As a complement to the theorem on reconstruction we also extend the known counterexamples (i.e., planar lattice-convex sets which are not reconstructible, up to translations and reflections) to an infinite family of counterexamples.

Affiliated with

Also associated with

No associations

Rating

On the reconstruction of planar lattice-convex sets from the covariogram does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the reconstruction of planar lattice-convex sets from the covariogram, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the reconstruction of planar lattice-convex sets from the covariogram will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-586752