Random generation of Q-convex sets

Theoretical Computer Science

Volumn 347, Issue 1-2, 2005, Pages 393-414

  Brunetti, Sara ^a   Daurat, Alain ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b UMR 7005   (France)

Author keywords

Convexity; Lattice sets; Salient points; Uniform generator

Indexed keywords

PROBLEM SOLVING; RANDOM NUMBER GENERATION; SET THEORY;

LATTICE SETS; Q-CONVEX SETS; WORD CODING;

COMPUTER SCIENCE;

EID: 27844451071     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.033     Document Type: Article

References (16)

1. I. Bárány The limit shape of convex lattice polygons Discrete Comput. Geom. 13 3-4 1995 279 295
2. E. Barcucci, A. Del Lungo, M. Nivat, and R. Pinzani Reconstructing convex polyominoes from horizontal and vertical projections Theoret. Comput. Sci. 155 2 1996 321 347
3. M. Bousquet-Mélou A method for the enumeration of various classes of column-convex polygons Discrete Math. 154 1-3 1996 1 25
4. S. Brunetti, and A. Daurat An algorithm reconstructing convex lattice sets Theoret. Comput. Sci. 304 1-3 2003 35 57
5. S. Brunetti, A. Daurat, and A. Del Lungo Approximate X-rays reconstruction of special lattice sets Pure Math. Appl. 11 3 2000 409 425
6. A. Daurat Salient points of Q-convex sets Internat. J. Pattern Recognition Artificial Intelligence 15 7 2001 1023 1030
7. A. Daurat Determination of Q-convex sets by X-rays Theoret. Comput. Sci. 332 1-3 2005 19 45
8. A. Daurat, A. Del Lungo, and M. Nivat Median points of discrete sets according to a linear distance Discrete Comput. Geom. 23 4 2000 465 483
9. M.P. Delest, and G. Viennot Algebraic languages and polyomino enumeration Theoret. Comput. Sci. 112 1984 65 79
10. W. Hochstättler, M. Loebl, and C. Moll Generating convex polyominoes at random Discrete Math. 153 1-3 1996 165 176
11. A. Ivić, J. Koplowitz, and J. Žunić On the number of digital convex polygons inscribed into an (m, m ) -grid IEEE Trans. Inform. Theory 40 5 1994 1681 1686
12. A.M. Law, and W.D. Kelton Simulation Modeling and Analysis second ed. 1991 McGraw-Hill New York
13. K.Y. Lin, and S.J. Chang Rigorous results for the number of convex polygons on the square and honeycomb lattices J. Phys. A 21 11 1988 2635 2642
14. J. O'Rourke Computational Geometry in C second ed. 1998 Cambridge University Press Cambridge
15. C. Ronse A bibliography on digital and computational convexity IEEE Trans. PAMI 11 2 1989 181 190
16. C. Valenti, An experimental study of the stability problem in discrete tomography, in: Proc. IWCIA 2003, Electronic Notes in Discrete Mathematics, Vol. 12, Elsevier, Amsterdam, 2003.