Abstract
We define the projection of a tiling as a matrix P = (p ij ) where p i1 is number of t 1,2 tiles in row i and p i2 is the number of t 2,1 tiles in row i. We give an efficient algorithm to tile a 2D-square grid with only t 1,2, t 2,1, t 1,1 tiles such that the projection of this tiling is the same as the given projection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrea, F.: Complexity Results and Reconstruction Algorithms for Discrete Tomography. PhD thesis (2002)
Chrobak, M., Couperus, P., Durr, C., Woeginger, G.: A note on tiling under tomographic constraints. Theoretical Computer Science 290(3), 2125–2136 (2003)
Durr, C., Goles, E., Rapaport, I., Remila, E.: Tiling with bars under tomographic constraints. Theoretical Computer Science 290(3), 1317–1329 (2003)
Herman, G.T., Kuba, A. (eds.): DISCRETE TOMOGRAPHY Foundations, Algorithms, and Applications. Birkhäuser, Boston (1999)
Masilamani, V., Krithivasan, K., Nalinadevi, K.: Reconstruction of 2D-tiling with horizontal, vertical dominoes and a clear cell. In: ADCOM (to appear, 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vedhanayagam, M., Krithivasan, K. (2006). An Efficient Reconstruction of 2D-Tiling with t 1,2, t 2,1, t 1,1 Tiles. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds) Combinatorial Image Analysis. IWCIA 2006. Lecture Notes in Computer Science, vol 4040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11774938_38
Download citation
DOI: https://doi.org/10.1007/11774938_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35153-5
Online ISBN: 978-3-540-35154-2
eBook Packages: Computer ScienceComputer Science (R0)