Neighborhood Sequences in the Diamond Grid
2008 (English)In: Image analysis: from theory to applications, Research Publishing, Singapore, Chennai , 2008, 187-195 p.Chapter in book (Other (popular science, discussion, etc.))
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. An algorithm to compute a shortest path defined by a neighborhood sequence between any two points in the diamond grid is presented. A formula to compute the distance based on neighborhood sequences is given. A necessary and sufficient condition to have a metric distance function is proved.
Place, publisher, year, edition, pages
Research Publishing, Singapore, Chennai , 2008. 187-195 p.
IdentifiersURN: urn:nbn:se:uu:diva-17787ISBN: 978-981-08-0228-8OAI: oai:DiVA.org:uu-17787DiVA: diva2:45558