[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections

  • Conference paper
Theoretical Computer Science (ICTCS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3701))

Included in the following conference series:

  • 394 Accesses

Abstract

This paper deals with the reconstruction of an alternate periodical binary matrix from its orthogonal projections. For a fixed vector (p,q), a binary matrix A is alternate periodical when A \(_{i,{\it j}}\)+A \(_{i+{\it p},{\it j}+{\it q}}\)=1. For vectors (p = 1,q = 1),(p,0) and (0,q) we propose polynomial time algorithms to reconstruct an alternate periodical binary matrix from both its vertical and horizontal projections if such a matrix exists.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Barcucci, E., Del Lungo, A.: Reconstructing convex polyominoes from their horizontal and vertical projections. Theoretical computer science 155(1), 321–347 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brualdi, R.A.: Matrices of zeros and ones with fixed row and column sum. Linear algebra and its applications 3, 159–231 (1980)

    Article  MathSciNet  Google Scholar 

  3. Chrobak, M., Dürr, C.: Reconstructing Polyatomic Structures from X-Rays: NP Completness proof for three Atoms. Theoretical computer science 259(1), 81–98 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chrobak, M., Dürr, C.: Reconstructing hv-convex polyominoes from orthogonal projections. Information Processing Letters 69, 283–289 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Del Lungo, A., Frosini, A., Nivat, M., Vuillon, L.: Reconstruction under Periodicity Constraints. ICALP 1, 38–56 (2002)

    Google Scholar 

  6. Kuba, A., Hermann, G.T.: Discrete Tomography: a historical overview. In: Discrete Tomography: Foundations, Algorithms and Applications, pp. 3–33. Birkhauser, Basel (1999)

    Google Scholar 

  7. Kuba, A., Hermann, G.T.: Discrete Tomography: Foundations, Algorithms and Applications. Birkhauser, Basel (1999)

    MATH  Google Scholar 

  8. Ryser, H.J.: Combinatorial Properties of Matrices of Zeros and Ones. Canad. J. Math. 9, 371–377 (1957)

    Article  MATH  MathSciNet  Google Scholar 

  9. Woeginger, G.J.: The reconstruction of polyominoes from their orthogonal projections. Information Processing Letters 77(5-6), 225–229 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Costa, MC., Jarray, F., Picouleau, C. (2005). Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_14

Download citation

  • DOI: https://doi.org/10.1007/11560586_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29106-0

  • Online ISBN: 978-3-540-32024-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics