Generation and reconstruction of hv-convex 8-connected discrete sets
AbstractAn algorithm is given to generate 2-dimensional hv-convex 8-connected discrete sets uniformly. This algorithm is based on an extension of a theory previously used for a more special class of hv-convex discrete sets. The second part of the paper deals with the reconstruction of hv-convex 8-connected discrete sets. The main idea of this algorithm is to rewrite the whole reconstruction problem as a 2SAT problem. Using some a priori knowledge we reduced the number of iterations and the number of clauses in the 2SAT expression which results in reduction of execution time.
Download data is not yet available.
How to Cite
Balogh, E. (2001). Generation and reconstruction of hv-convex 8-connected discrete sets. Acta Cybernetica, 15(2), 185-200. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3573