An Efficient Algorithm to Compute Subsets of Points in Z~n

摘要

In this paper we show a more efficient algorithm than that in [8] to compute subsets of points non-congruent by isometrics. This algorithm can be used to reconstruct the object from the digital image. Both algorithms are compared, highlighting the improvements obtained in terms of CPU time.