Citation Context

...d as a shortest path in which the neighborhood that is allowed in each step is given by a neighborhood sequence. With weighted distances, a two-scan algorithm is sufficient for any point-lattice, see =-=[2, 9]-=-. For ns-distances, three scans are needed for computing correct DTs on a square grid [10]. In this paper, we consider the weighted ns-distance [11, 12, 13] in which both weights and a neighborhood se...

Citation Context

...ximations for the 2- and 3-dimensional cases, see for example [10] and [11]. Furthermore, computation of weighted (Chamfer) distances in arbitrary dimensions on general point lattices is discussed in =-=[12]-=-. More recently, Seol and Cheun [8] proposed an approximation of the form Da,b(x) = aD∞(x) + bD1(x), (7) where a and b are strictly positive parameters to be determined by solving the following 2× 2 l...

Citation Context

...he 2D square grid, and 3D cubic and so-called FCC and BCC cubic grids, respectively. Similar results for other kinds of grids are also known, see e.g. [8] (nD hexagonal grids), [9] (diamond grid) and =-=[10]-=- (general point grids) and the references given there. Classical chamfer distances using 3× 3, 5× 5 and 7× 7 neighborhoods given by Borgefors [1,2] are generated by the masks 4 3 4 3 0 3 4 3 4 , 14 11...