Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419738 | Discrete Applied Mathematics | 2009 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Robin Strand,