A Comparison Among Distances Based on Neighborhood Sequences in Regular Grids

  • Benedek Nagy
Conference paper

DOI: 10.1007/11499145_104

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3540)
Cite this paper as:
Nagy B. (2005) A Comparison Among Distances Based on Neighborhood Sequences in Regular Grids. In: Kalviainen H., Parkkinen J., Kaarna A. (eds) Image Analysis. SCIA 2005. Lecture Notes in Computer Science, vol 3540. Springer, Berlin, Heidelberg

Abstract

The theory of neighborhood sequences is applicable in many image-processing algorithms. The theory is well developed for the square grid. Recently there are some results for the hexagonal grid as well. In this paper, we are considering all the three regular grids in the plane. We show that there are some very essential differences occurring. On the triangular plane the distance has metric properties. The distances on the square and the hexagonal case may not meet the triangular inequality. There are non-symmetric distances on the hexagonal case. In addition, contrary to the other two grids,the distance can depend on the order of the initial elements of the neighborhood sequence.Moreover in the hexagonal grid it is possible that circles with different radii are the same (using different neighborhood sequences). On the square grid the circles with the same radius are in a well ordered set, but in the hexagonal case there can be non-comparable circles.

Keywords

Digital geometry Neighborhood sequences Square grid Hexagonal grid Triangular grid Distance 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Benedek Nagy
    • 1
    • 2
  1. 1.Department of Computer Science, Faculty of InformaticsUniversity of DebrecenDebrecenHungary
  2. 2.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain

Personalised recommendations