作者: Szabolcs Baják , Benedek Nagy , János Farkas
DOI:
关键词:
摘要: Distance measuring is a very important task in digital geometry and image processing. Due to our natural approach we think of the set points that are equally far from given point as Euclidean circle. Using classical neighbourhood relations on grids, get circles greatly differ In this paper examine different methods approximating circle square grid, considering possible motivat ions well. We compare perimeter-, area-, curve- noncompactness-based approximations their realization using sequences. also provide table which summarizes results, can be used when developing applications support MSC2000 code: 52C99.