Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections [chapter]

Péter Balázs
2009 Lecture Notes in Computer Science  
The problem of reconstructing some special hv-convex discrete sets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class -the class of hv-convex canonical discrete sets -and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further
more » ... theoretical consequences and present experimental results as well.
doi:10.1007/978-3-642-10210-3_22 fatcat:hmlougjxszeljnle3krnbdosvu