Title of article
Weighted distances based on neighborhood sequences for point-lattices Original Research Article
Author/Authors
Robin Strand، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
12
From page
641
To page
652
Abstract
A path-based distance is defined as the minimal cost-path between two points. One such distance function is the weighted distance based on a neighborhood sequence. It can be defined using any number of neighborhood relations and weights in conjunction with a neighborhood sequence. The neighborhood sequence restricts some steps in the path to a smaller neighborhood. We give formulas for computing the point-to-point distance and conditions for metricity for weighted distances based on neighborhood sequences with two neighborhood relations for the general case of point-lattices.
Keywords
Neighborhood sequences , Digital geometry , Distance functions , Image processing
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
886998
Link To Document