Neighborhood Sequences in the Diamond Grid: Algorithms with Two and Three Neighbors
2009 (English)In: International journal of imaging systems and technology (Print), ISSN 0899-9457, E-ISSN 1098-1098, Vol. 19, no 2, 146-157 p.Article in journal (Refereed) Published
In the digital image processing, digital distances are useful; distances based on neighborhood sequences are widely used. In this article, 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 with two neighborhood relations is given. The metric and nonmetric properties of some distances based on neighborhood sequences are also discussed. Finally, the constrained distance transformation is shown.
Place, publisher, year, edition, pages
Wiley Periodicals, Inc. , 2009. Vol. 19, no 2, 146-157 p.
digital geometry, nonstandard 3D grids, neighborhood sequences, digital distances, distance transform
Computer Vision and Robotics (Autonomous Systems) Computational Mathematics
Research subject Computerized Image Analysis
IdentifiersURN: urn:nbn:se:uu:diva-109538DOI: 10.1002/ima.20182ISI: 000266505900012ISBN: 978-3-540-89645-6OAI: oai:DiVA.org:uu-109538DiVA: diva2:272760