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

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

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Balogh Emese
Testületi szerző: Conference for PhD Students in Computer Science (2.) (2000) (Szeged)
Dokumentumtípus: Cikk
Megjelent: 2001
Sorozat:Acta cybernetica 15 No. 2
Kulcsszavak:Számítástechnika, Kibernetika, Algoritmus
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12672
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:185-200
ISSN:0324-721X