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
LEADER 01424nab a2200229 i 4500
001 acta12672
005 20220614114919.0
008 161015s2001 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Balogh Emese 
245 1 0 |a Generation and reconstruction of hv-convex 8-connected discrete sets  |h [elektronikus dokumentum] /  |c  Balogh Emese 
260 |c 2001 
300 |a 185-200 
490 0 |a Acta cybernetica  |v 15 No. 2 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika, Algoritmus 
710 |a Conference for PhD Students in Computer Science (2.) (2000) (Szeged) 
856 4 0 |u http://acta.bibl.u-szeged.hu/12672/1/cybernetica_015_numb_002_185-200.pdf  |z Dokumentum-elérés