Abstract
The problem of reconstructing a two-dimensional discrete set from its projections has been studied in discrete mathematics and applied in several areas. It has some interesting applications in image processing, electron microscopy, statistical data security, biplane angiography and graph theory. This chapter presents the computational complexity results of the problem of reconstructing a set from its horizontal and vertical projections with respect to some classes of sets on which some connectivity constrzints are imposed. We show that this reconstruction problem can be solved in polynomial time in a class of discrete sets, and is NP-complete otherwise.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
