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

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

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

Download (918kB)

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.

Item Type: Article
Event Title: Conference for PhD Students in Computer Science, 2., 2000, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2001
Volume: 15
Number: 2
Page Range: pp. 185-200
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 199-200.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 15:15
URI: http://acta.bibl.u-szeged.hu/id/eprint/12672

Actions (login required)

View Item View Item