Abstract
This paper investigates general properties of distance functions defined over digitized space. We assume that a distance between two points is defined as the length of a shortest path connecting them in the underlying graph which is defined by a given neighborhood sequence. Many typical distance functions can be described in this form, but there are cases in which given neighborhood sequence do not define distance functions. We first derive a necessary and sufficient condition for a neighborhood sequence to define a distance function. We then discuss another important problem of estimating how tight such distances can approximate the Euclid distance from the view point of relative error and absolute error.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
