论文信息 - Random Generation of hv-Convex Polyominoes with Given Horizontal Projection

Random Generation of hv-Convex Polyominoes with Given Horizontal Projection

We provide a quadratic-time algorithm for generating hv-convex polyominoes according to a given horizontal projection. The method can be used to generate hv-convex polyominoes with the prescribed projection and with a fixed or arbitrary horizontal dimension, from a uniform random distribution.

Péter Balázs | Norbert Hantos | P. Balázs | Norbert Hantos

[1] Péter Balázs,et al. Reconstruction and Enumeration of hv-Convex Polyominoes with Given Horizontal Projection , 2013, CIARP.

[2] Martin Loebl,et al. Generating convex polyominoes at random , 1996, Discret. Math..

[3] Alain Daurat,et al. Random generation of Q-convex sets , 2005, Theor. Comput. Sci..

[4] Maurice Nivat,et al. The number of convex polyominoes reconstructible from their orthogonal projections , 1996, Discret. Math..

[5] Andrea Frosini,et al. Enumeration of convex polyominoes using the ECO method , 2003, DMCS.

[6] Attila Kuba,et al. Reconstruction of 4- and 8-connected convex discrete sets from row and column projections , 2001 .

[7] Attila Kuba,et al. Comparison of algorithms for reconstructing hv-convex discrete sets , 2001 .

[8] Marek Chrobak,et al. Reconstructing hv-Convex Polyominoes from Orthogonal Projections , 1999, Inf. Process. Lett..

[9] Andrea Frosini,et al. On the Generation and Enumeration of some Classes of Convex Polyominoes , 2004, Electron. J. Comb..

[10] M. Nivat,et al. Medians of polyominoes: A property for reconstruction , 1998 .

[11] Attila Kuba,et al. Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis) , 2007 .

[12] G. Herman,et al. Discrete tomography : foundations, algorithms, and applications , 1999 .

[13] Alberto Del Lungo. Polyominoes Defined by Two Vectors , 1994, Theor. Comput. Sci..