Combinatorial Image Analysis

Volume 5852 of the series Lecture Notes in Computer Science pp 109-121

Neighborhood Sequences in the Diamond Grid – Algorithms with Four Neighbors

  • Benedek NagyAffiliated withDepartment of Computer Science, Faculty of Informatics, University of Debrecen
  • , Robin StrandAffiliated withCentre for Image Analysis, Uppsala University

* Final gross prices may vary according to local VAT.

Get Access


In digital image processing digital distances are useful; distances based on neighborhood sequences are widely used. In this paper the diamond grid is considered, that is the three-dimensional grid of Carbon atoms in the diamond crystal. This grid can be described by four coordinate values using axes of the directions of atomic bonds. In this way the sum of the coordinate values can be either zero or one. An algorithm to compute a shortest path defined by a neighborhood sequence between any two points in the diamond grid is presented. The metric and non-metric properties of some distances based on neighborhood sequences are also discussed. The constrained distance transformation and digital balls obtained by some distance functions are presented.


digital geometry non-standard grids neighborhood sequences diamond grid distance transform