Neighborhood Sequences in the Diamond Grid - Algorithms with Four Neighbors
2009 (English)In: Proceedings, theoretical track, International Workshop on Combinatorial Image Analysis (IWCIA 2009), Mexico, Berlin / Heidelberg: Springer , 2009, 109-121 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Berlin / Heidelberg: Springer , 2009. 109-121 p.
, Lecture Notes in Computer Science, ISSN 1611-3349 ; 5852
Computer Vision and Robotics (Autonomous Systems) Computational Mathematics
Research subject Computerized Image Analysis
IdentifiersURN: urn:nbn:se:uu:diva-109534ISBN: 978-3-540-89645-6OAI: oai:DiVA.org:uu-109534DiVA: diva2:272755