Generation and reconstruction of hv-convex 8-connected discrete sets

Balogh Emese: Generation and reconstruction of hv-convex 8-connected discrete sets. In: Acta cybernetica, (15) 2. pp. 185-200. (2001)

[thumbnail of cybernetica_015_numb_002_185-200.pdf]
Cikk, tanulmány, mű

Download (918kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2001
Volume: 15
Number: 2
ISSN: 0324-721X
Page Range: pp. 185-200
Language: English
Place of Publication: Szeged
Event Title: Conference for PhD Students in Computer Science (2.) (2000) (Szeged)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika, Algoritmus
Additional Information: Bibliogr.: p. 199-200. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 11:49

Actions (login required)

View Item View Item