Abstract
AbstractA remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexity and connectedness. In this paper we study the problem of their reconstruction from orthogonal projections, relying on the approach defined by Barcucci et al. (Theor Comput Sci 155(2):321–347, 1996). In particular, during the reconstruction process it may be necessary to expand a convex subset of the interior part of the polyomino, say the polyomino kernel, by adding points at specific positions of its contour, without losing its convexity. To reach this goal we consider convexity in terms of certain combinatorial properties of the boundary word encoding the polyomino. So, we first show some conditions that allow us to extend the kernel maintaining the convexity. Then, we provide examples where the addition of one or two points causes a loss of convexity, which can be restored by adding other points, whose number and positions cannot be determined a priori.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference41 articles.
1. Balazs P, Gara M (2008) Decision trees in binary tomography for supporting the reconstruction of hv-convex connected images. ACIVS 2008:433–443
2. Barcucci E, Del Lungo A, Nivat M, Pinzani R (1996) Reconstructing convex polyominoes from horizontal and vertical projections. Theor Comput Sci 155(2):321–347
3. Barcucci E, Del Lungo A, Nivat M, Pinzani R (2001) X-rays characterizing some classes of discrete sets. Linear Algebra Appl. 339:3–21
4. Berstel J, de Luca A (1997) Sturmian words, Lyndon words and trees. Theor Comput Sci 178(1–2):171–203
5. Berstel J, Lauve A, Reutenauer C, Saliola F (2008) Combinatorics on words: Christoffel words and repetitions in words. Université de Montréal et American Mathematical Society 27, CRM monograph series
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献