Result: The number of line-convex directed polyominoes having the same orthogonal projections
Title:
The number of line-convex directed polyominoes having the same orthogonal projections
Authors:
Source:
Discrete geometry for computer imagery (13th International conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006)0DGCI 2006. :77-85
Publisher Information:
Berlin; Heidelberg; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 15 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Reconnaissance des formes. Traitement numérique des images. Géométrie algorithmique, Pattern recognition. Digital image processing. Computational geometry, Ambiguité, Ambiguity, Ambiguedad, Convexité, Convexity, Convexidad, Géométrie algorithmique, Computational geometry, Geometría computacional, Géométrie discrète, Discrete geometry, Geometría discreta, Pavage, Tiling, Projection orthogonale, Orthogonal projection, Proyección ortogonal, Traitement image, Image processing, Procesamiento imagen
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Algorithms and Artificial Intelligence University of Szeged Árpád tér 2, 6720 Szeged, Hungary
ISSN:
0302-9743
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150489
Database:
PASCAL Archive
Further Information
The number of line-convex directed polyominoes with given horizontal and vertical projections is studied. It is proven that diagonally convex directed polyominoes are uniquely determined by their orthogonal projections. The proof of this result is algorithmical. As a counterpart, we show that ambiguity can be exponential if antidiagonal convexity is assumed about the polyomino. Then, the results are generalised to polyominoes having convexity property along arbitrary lines.