Detection of the discrete convexity of polyominoes

Discrete Applied Mathematics

Volumn 125, Issue 1, 2003, Pages 115-133

  Debled Rennesson, Isabelle ^a   Rémy, Jean Luc ^a   Rouyer Degli, Jocelyne ^b  

^a LORIA   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Discrete convexity; Discrete line; Discrete tomography; Polyominoes; Segmentation

Indexed keywords

COMBINATORIAL MATHEMATICS; IMAGE SEGMENTATION; MATHEMATICAL TECHNIQUES;

CONVEX HULL; DISCRETE CONVEXITY; DISCRETE LINE; DISCRETE REGIONS; DISCRETE TOMOGRAPHY; POLYOMINOES;

TOMOGRAPHY;

EID: 84867932322     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00227-5     Document Type: Article

References (32)

1. B. Aspvall, M.F. Plass, and R.E. Tarjan A linear-time algorithm for testing the truth of certain quantified boolean formulas Inform. Process. Lett. 8 3 1979 121 123
2. E. Balogh, A. Kuba, C. Devenyi, A. Del Lungo, Comparison of algorithms for reconstructing hv-convex discrete sets, 2000, Lin. Algebra Appl., to appear.
3. E. Barcucci, S. Brunetti, A. Del Lungo, M. Nivat, Reconstruction of discrete sets from three or more X-rays, Fourth Italian Conference on Algorithms and Complexity (CIAC, 2000).
4. 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
5. E. Barcucci, A. Del Lungo, M. Nivat, and R. Pinzani Medians of polyominoes: a property for the reconstruction Int. J. Imaging Systems Technol. 8 1998 69 77
6. N. Beldiceanu, and E. Contejean Introducing global constraints in CHIP J. Math. Comput. Modelling 12 1994 97 123
7. S. Brunetti, A. Daurat, Reconstruction of discrete sets from two or more projections in any direction, Proceedings of the Seventh International Workshop on Combinatorial Image Analysis (IWCIA, 2000), Caen, 2000, pp. 241-258.
8. S. Brunetti, A. Del Lungo, A. Daurat, An algorithm for reconstructing special lattice sets from their approximate X-rays. Discrete Geometry for Computer Imagery (DGCI 2000), Uppsala (Sweden), Lecture Notes in Computer Science, Vol. 1953, Springer, Berlin, 2000, pp. 113-125.
9. S. Brunetti, A. Del Lungo, F. Del Ristoro, A. Kuba, M. Nivat, Reconstruction of 4- and 8-connected convex discrete sets from row and column projections, 1999, Lin. Algebra Appl., to appear.
10. J.-M. Chassery, A. Montanvert, Géométrie discrète en analyse d'images, Traité des nouvelles technologies, série Images, Hermes, 1991.
11. M. Chrobak, and C. Dürr Reconstructing hv-convex polyominoes from orthogonal projections Inform. Process. Lett. 69 1999 283 289
12. I. Debled-Rennesson, Etude et reconnaissance des droites et plans discrets, Thèse, Université Louis Pasteur, Strasbourg, 1995.
13. I. Debled-Rennesson, and J.-P. Reveillès A linear algorithm for segmentation of digital curves Int. J. Pattern Recognition, Artif. Intell. 9 1995 635 662
14. A. Del Lungo, and N. Nivat G.T. Herman, A. Kuba, Reconstruction of Connected Sets from Two Projections 1999 Birkhäuser Boston 163 188 (Chapter 7)
15. A. Del Lungo, M. Nivat, and R. Pinzani The number of convex polyominoes reconstructible from their orthogonal projections Discrete Math. 157 1996 65 78
16. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, F. Berthier, The constraint logic programming language CHIP, Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, Springer, Berlin, 1988, pp. 693-702.
17. R.J. Gardner, and P. Gritzmann G.T. Herman, A. Kuba, Uniqueness and Complexity in Discrete Tomography 1999 Birkhäuser Boston 85 113 (Chapter 4)
18. W. Hochstattler, M. Loebl, and C. Moll Generating convex polyominoes at random Discrete Math. 153 1996 165 176
19. A. Hübler, R. Klette, K. Voß, Determination of the convex hull of a finite set of planar points within linear time, Elektron. Inform. Kybernet., 1981, pp. 121-139.
20. C.E. Kim Digital convexity, straightness and convex polygons IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4 1982 618 626
21. C.E. Kim, and A. Rosenfeld On the convexity of digital regions Pattern Recognition 5 1980 1010 1015
22. C.E. Kim, and A. Rosenfeld Digital straight lines and convexity of digital regions IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4 1982 149 153
23. A. Kuba, Reconstruction in different classes of 2D discrete sets, Discrete Geometry for Computer Imagery (DGCI'99), Marne-la-Vallée, Lecture Notes in Computer Science, Vol. 1568, Springer, Berlin, 1999, pp. 153-163.
24. A. Kuba, and G. T. Herman G.T. Herman, A. Kuba, Discrete Tomography: Foundations, Algorithms, and Applications 1999 Birkhäuser Boston
25. K. Mariott, and P.J. Stuckey Programming with Constraints: An Introduction 1998 MIT Press Reading, MA
26. M. Minsky, and S. Papert Perceptrons 1969 MIT Press Reading, MA
27. J-.P. Reveillès, Structure des droites discrètes, Journées mathématique et informatique, Marseille-Luminy, Octobre 1989.
28. J-.P. Reveillès, Géométrie discrète, calculs en nombre entiers et algorithmique, Thèse d'état, Université Louis Pasteur, Strasbourg, 1991.
29. I. Sivignon, Reconstruction de polyominos convexes par programmation par contraintes, Stage Report of "Magistère d'Informatique 1ère année, ENS Lyon", realized at LORIA under the direction of Debled-Rennesson and A. Bockmayr, 1999.
30. J. Slansky Recognition of convex blobs Pattern Recognition 2 1970 3 10
31. G.J. Woeginger, The reconstruction of polyominoes from their orthogonal projections, Technical Report, Technische Universität Graz, 1996.
32. T. Zajac, Reconstructing convex polyominoes using constraint programming, Master Thesis, Wroclaw University of Technology, Pologne.