### Abstract

The reconstruction of hv-convex binary matrices from their absorbed projections is considered. Although this problem is NP-complete if the non-absorbed row and column sums are available, it is proved that such a reconstruction problem can be solved in polynomial time from absorbed projections when the absorption is represented by β = (1 + √5)/2. Also a reconstruction algorithm is given to determine the whole structure of hv-convex binary matrices from such projections.

Original language | English |
---|---|

Pages (from-to) | 381-390 |

Number of pages | 10 |

Journal | Electronic Notes in Theoretical Computer Science |

Volume | 46 |

DOIs | |

Publication status | Published - Aug 2001 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science (miscellaneous)

### Cite this

**Reconstruction of hv-convex binary matrices from their absorbed projections.** / Kuba, A.; Nagy, Antal.

Research output: Contribution to journal › Article

*Electronic Notes in Theoretical Computer Science*, vol. 46, pp. 381-390. https://doi.org/10.1016/S1571-0661(04)80998-8

}

TY - JOUR

T1 - Reconstruction of hv-convex binary matrices from their absorbed projections

AU - Kuba, A.

AU - Nagy, Antal

PY - 2001/8

Y1 - 2001/8

N2 - The reconstruction of hv-convex binary matrices from their absorbed projections is considered. Although this problem is NP-complete if the non-absorbed row and column sums are available, it is proved that such a reconstruction problem can be solved in polynomial time from absorbed projections when the absorption is represented by β = (1 + √5)/2. Also a reconstruction algorithm is given to determine the whole structure of hv-convex binary matrices from such projections.

AB - The reconstruction of hv-convex binary matrices from their absorbed projections is considered. Although this problem is NP-complete if the non-absorbed row and column sums are available, it is proved that such a reconstruction problem can be solved in polynomial time from absorbed projections when the absorption is represented by β = (1 + √5)/2. Also a reconstruction algorithm is given to determine the whole structure of hv-convex binary matrices from such projections.

UR - http://www.scopus.com/inward/record.url?scp=18944406640&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18944406640&partnerID=8YFLogxK

U2 - 10.1016/S1571-0661(04)80998-8

DO - 10.1016/S1571-0661(04)80998-8

M3 - Article

AN - SCOPUS:18944406640

VL - 46

SP - 381

EP - 390

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

ER -