Generalized distances in digital geometry (Q1095667): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Partha Pratim Das / rank
 
Normal rank
Property / author
 
Property / author: Partha Pratim Chakrabarti / rank
 
Normal rank
Property / author
 
Property / author: Biswa Nath Chatterji / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0255(87)90015-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974763083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance functions in digital geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The m-dimensional grid point space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and distance functions on three-dimensional digitized pictures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional digital topology / rank
 
Normal rank

Latest revision as of 12:38, 18 June 2024

scientific article
Language Label Description Also known as
English
Generalized distances in digital geometry
scientific article

    Statements

    Generalized distances in digital geometry (English)
    0 references
    1987
    0 references
    This paper proposes a generalized distance measure called m-neighbour distance in quantized n-dimensional space. Given two points \(P=\{x_ i\}\) and \(Q=\{y_ i\}\) for \(1\leq i\leq n\), the m-neighbour distance is defined as: \[ d^ n_ m(P,Q)=\max (\max^{n}_{k=1}X_ k,\quad \lceil \sum^{n}_{k=1}X_ k/m\rceil)\quad, \] where \(X_ k=| x_ k-y_ k|\), \(1\leq k\leq n\) and m,n\(\in {\mathbb{N}}.\) Given a point \(P=\{x_ i\}\); an r-neighbour of P is defined as \(Q=\{y_ i\}:\) \(0\leq | x_ i-y_ i| \leq 1\) for \(1\leq i\leq n\) and \(\sum^{n}_{1}| x_ i-y_ i| =r\). An r-neighbour of P has `n-r' vertices in common with P. It is shown that \(d^ n_ m(P,Q)\) is a distance metric, and an algorithm is given to trace the shortest path composed of successive r- neighbours between points P and Q. It is shown that \(d^ n_ r(P,Q)\) is the length of the path.
    0 references
    generalized distance measure
    0 references
    m-neighbour distance
    0 references
    quantized n- dimensional space
    0 references
    distance metric
    0 references
    shortest path
    0 references

    Identifiers