Találati lista | Tudóstér

001-es BibID:	BIBFORM010584
Első szerző:	Nagy Benedek (informatikus, matematikus)
Cím:	Neighborhood Sequences in the Diamond Grid : algorithms with Four Neighbors / Benedek Nagy, Robin Strand
Dátum:	2009
Megjegyzések:	In digital image processing digital distances are useful; distances based on neighborhood sequences are widely used. In this paper the diamond grid is considered, that is the three-dimensional grid of Carbon atoms in the diamond crystal. This grid can be described by four coordinate values using axes of the directions of atomic bonds. In this way the sum of the coordinate values can be either zero or one. An algorithm to compute a shortest path defined by a neighborhood sequence between any two points in the diamond grid is presented. The metric and non-metric properties of some distances based on neighborhood sequences are also discussed. The constrained distance transformation and digital balls obtained by some distance functions are presented.
Tárgyszavak:	Természettudományok Matematika- és számítástudományok előadáskivonat digital geometry non-standard grids neighborhood sequences diamond grid distance transform
Megjelenés:	Combinatorial Image Analysis : 13th International Workshop, IWCIA 2009, Playa del Carmen, Mexico, November 24-27, 2009. Proceedings / ed. David Hutchison [et al.]. - p. 111-123. -
További szerzők:	Strand, Robin
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: