Institute of Informatics
Acta Cybernetica
Past Issues
Volume 15, Number 2, 2001
Generation and reconstruction of hv-convex 8-connected discrete sets
# Generation and reconstruction of hv-convex 8-connected discrete sets

**Emese Balogh**

### Abstract (in LaTeX format)

An 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.

**Keywords: ** discrete tomography, reconstruction from projections, convex discrete set, generation at random.

### Full text

Available electronic editions: PDF.

### DOI

DOI is not available for this article.

### BibTeX entry
`
@article{Balogh:2001:ActaCybernetica,`

author = {Emese Balogh},

title = {Generation and reconstruction of hv-convex 8-connected discrete sets},

journal = {Acta Cybernetica},

year = {2001},

volume = {15},

pages = {185--200},

number = {2},

abstract = {An 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.},

keywords = {discrete tomography, reconstruction from projections, convex discrete set, generation at random}

}