Reconstruction algorithms for hv-convex 4- and 8-connected discrete sets

A new algorithm is presented for reconstructing hv-convex polyominoes and hv-convex 8-connected discrete sets. A systematic comparison is done to compare this method with two other methods; one of them has the best known worst case complexity and the other one has the best known average time complexity. From the experimental comparisons, it turned out that the new algorithm summarizes the good properties of the two other algorithms.