Octagonal distances for digital pictures
From MaRDI portal
DOI10.1016/0020-0255(90)90008-XzbMATH Open0715.68094OpenAlexW2081952246MaRDI QIDQ751867FDOQ751867
Authors: Partha Pratim Das, Biswa Nath Chatterji 
Publication date: 1990
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(90)90008-x
Recommendations
Cites Work
Cited In (18)
- Discrete euclidean metrics
- Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
- Knight's distance in digital geometry
- Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids
- Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
- Computable proximity of \(\ell_1\)-discs on the digital plane
- Non-traditional 2D grids in combinatorial imaging -- advances and challenges
- Some characterizations of city block distance
- Digital distance functions on three-dimensional grids
- Distances based on neighbourhood sequences in non-standard three-dimensional grids
- Distance with generalized neighbourhood sequences in \(n D\) and \(\infty D\)
- Weighted distances based on neighborhood sequences for point-lattices
- Best simple octagonal distances in digital geometry
- Metrically independent sets in the digital plane
- General neighborhood sequences in \(\mathbb Z^n\)
- Errors in digitized area measurements: circles and rectangles
- Approximating the Euclidean distance using non-periodic neighbourhood sequences
- The discrete version of a geometric duality theorem
This page was built for publication: Octagonal distances for digital pictures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751867)
