Preprint
Article

This version is not peer-reviewed.

Best Proximity Points for Geraghty-Type Non-Self Mappings

Submitted:

25 November 2025

Posted:

26 November 2025

You are already at the latest version

Abstract
We study Geraghty-type non-self mappings within the framework of best proximity point theory. By introducing auxiliary functions with subsequential convergence, we establish general conditions ensuring the existence and uniqueness of best proximity points. Our results extend and unify earlier work on proximal and Kannan-type contractions under a Geraghty setting, and we provide counterexamples showing that the auxiliary assumptions are essential. As an illustration, we construct an explicit non-self alignment mapping on subsets of \( \mathbb{R} \)2 for which all hypotheses can be verified and the unique best proximity point, as well as the convergence of the associated proximal iteration, can be computed in closed form.
Keywords: 
;  ;  ;  ;  ;  ;  

1. Introduction and Preliminaries

Fixed point theory plays a fundamental role in nonlinear analysis, with applications ranging from differential equations to optimization problems. Classical results such as the Banach contraction principle provide powerful tools for self-mappings, but in many practical situations one encounters non-self mappings, where the appropriate substitute is the notion of best proximity points.
The development of the field has proceeded through several key milestones. In 1968, Kannan introduced a celebrated generalization of Banach’s contraction principle by proving that for a complete metric space ( X , d ) , any mapping T : X X satisfying
d ( T x , T y ) α d ( x , T x ) + d ( y , T y ) , x , y X ,
with α [ 0 , 1 2 ) , admits a unique fixed point [1]. A remarkable feature of Kannan’s theorem is that no continuity assumption on T is required. Later, Ariza-Ruiz and Jiménez-Melado (2010) extended this result by introducing weakly Kannan maps, in which the contractive coefficient depends on the points x , y . More precisely, there exists α : X × X [ 0 , 1 ) such that
d ( T x , T y ) α ( x , y ) [ d ( x , T x ) + d ( y , T y ) ] , x , y X ,
with the uniform bound sup { α ( x , y ) : a d ( x , y ) b } < 1 for all 0 < a b [1]. This flexibility allows one to capture the behavior of a wider class of nonlinear operators.
The move from fixed point results to best proximity point results was initiated by Sadiq Basha (2011), who introduced the concept of proximal contractions and established best proximity point theorems for non-self mappings [7]. The key idea is to characterize conditions under which, even in the absence of fixed points, one can still guarantee the existence of a point x * such that the distance between x * and its image T x * is minimal. Best proximity point results for Geraghty-type proximal contraction mappings were later developed in [6].
Subsequent work by Moradi provided a different perspective by introducing the use of an auxiliary function. Specifically, for mappings T , S : X X in a metric space ( X , d ) , it was shown in [5] that if S is one-to-one, continuous, and sequentially convergent, and if
d ( S T x , S T y ) k d ( S x , S y ) , x , y X ,
for some constant k ( 0 , 1 ) , then T possesses a best proximity point.
Building on these foundations, the present work introduces two novel classes of mappings: proximal Geraghty and proximal Kannan–Geraghty mappings of the first kind. We establish existence and uniqueness theorems for these mappings and illustrate, by examples, that the auxiliary conditions we impose are both natural and necessary. Before turning to our main results, we recall some fundamental concepts from best proximity theory.
Definition 1 
([8]). Let A , B be nonempty subsets of a metric space ( X , d ) . Thebest proximity sets A 0 and B 0 are defined as
A 0 : = { x A : d ( x , y ) = d ( A , B ) for some y B } , B 0 : = { y B : d ( x , y ) = d ( A , B ) for some x A } ,
where
d ( A , B ) : = inf { d ( x , y ) : x A , y B }
denotes the minimal distance between A and B.
When A and B are closed subsets of a normed linear space with d ( A , B ) > 0 , it is known that both A 0 and B 0 lie on the boundaries of their respective sets [7].
Definition 2 
([8]). Given a mapping T : A B , a point x * A is called a best proximity point of T if
d ( x * , T x * ) = d ( A , B ) .
Definition 3 
([7]). A mapping S : A B is called a proximal contraction of the first kind if there exists α [ 0 , 1 ) such that for all x 1 , x 2 , u 1 , u 2 A ,
d ( u 1 , S x 1 ) = d ( A , B ) , d ( u 2 , S x 2 ) = d ( A , B ) d ( u 1 , u 2 ) α d ( x 1 , x 2 ) .
For self-maps, this reduces exactly to the Banach contraction principle; for non-self maps, proximal contractions need not be contractions in the usual sense.
Corollary 1 
([4]). Let A , B be nonempty closed subsets of a complete metric space such that A 0 and B 0 are nonempty. Suppose T : A B and g : A A satisfy:
  • g is one-to-one and continuous, and g 1 : g ( A ) A is uniformly continuous;
  • T is a proximal contraction of the first kind with T ( A 0 ) B 0 .
Then there exists a unique x * A such that d ( g x * , T x * ) = d ( A , B ) . Moreover, for any x 0 A 0 , the sequence defined by d ( g x n + 1 , T x n ) = d ( A , B ) converges to x * .
When g = Id A , we simply say that T : A B is a proximal contraction if condition (b) holds.
Definition 4 
([4]). Let ( A , B ) be a nonempty pair of subsets of a metric space ( X , d ) . A mapping T : A B is called a proximal Kannan non-self mapping if there exists α [ 0 , 1 2 ) such that for all u , v , x , y A with
d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) ,
we have
d ( u , v ) α d * ( x , T x ) + d * ( y , T y ) ,
where
d * ( x , T x ) : = d ( x , T x ) d ( A , B ) 0 .
The class of proximal Kannan non-self mappings properly contains the class of Kannan non-self mappings.
Definition 5 
(Weak Proximal Kannan Non-Self Mapping [4]). Let ( X , d ) be a metric space, and let A , B X . A mapping T : A B is called a weak proximal Kannan non-self mapping if there exists α ( 0 , 1 2 ) such that for all u , v , x , y A with
d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) ,
the implication
1 r d * ( x , T x ) d ( x , y ) d ( u , v ) α [ d * ( x , T x ) + d * ( y , T y ) ]
holds, where r = α 1 α .
Theorem 1 
([4]). Let ( A , B ) be a nonempty pair of subsets of a complete metric space ( X , d ) such that A 0 is nonempty and closed. If T : A B is a weak proximal Kannan non-self mapping with T ( A 0 ) B 0 , then there exists a unique x * A such that d ( x * , T x * ) = d ( A , B ) . Moreover, if { x n } A satisfies d ( x n + 1 , T x n ) = d ( A , B ) , then x n x * .
Definition 6 
([9]). Let ( X , d ) be a metric space. A mapping T : X X is called a Geraghty contraction if there exists β Γ such that
d ( T x , T y ) β ( d ( x , y ) ) d ( x , y ) , x , y X ,
where Γ denotes the class of functions β : [ 0 , ) [ 0 , 1 ) with the property that
β ( t n ) 1 t n 0 .
Theorem 2 
([9]). Let ( X , d ) be a complete metric space and T : X X a Geraghty contraction. Then T has a unique fixed point.
According to [12], let ( X , d ) be a metric space. A mapping f : X X is said to be a Kannan–Geraghty self-mapping if there exists a function β Γ such that, for all x , y X ,
d ( f ( x ) , f ( y ) ) β ( d ( x , y ) ) · 1 2 [ d ( x , f ( x ) ) + d ( y , f ( y ) ) ] .
This definition combines the features of Kannan mappings with the flexibility of Geraghty-type control functions. Motivated by this, we now develop the non-self, proximal analogues.

2. Main Results

In this section, we introduce S-proximal contraction non-self mappings and S-proximal Kannan non-self mappings, and establish sufficient conditions for the existence and uniqueness of best proximity points in complete metric spaces. Before stating the main theorems, we recall the notion of an auxiliary function.
Definition 7. 
Let ( X , d ) be a metric space, and let A , B X . A mapping S : A B A B is called an auxiliary function if S ( A ) A and S ( B ) B .
Theorem 3 
(Extended Proximal Geraghty of the First Kind). Let ( A , B ) be a pair of nonempty subsets of a complete metric space ( X , d ) such that A 0 and B 0 are nonempty and closed. Let S be an auxiliary function that is continuous on A and B, one-to-one, subsequentially convergent, and satisfies S ( A 0 ) A 0 and S ( B 0 ) B 0 .
Suppose T : A B is a mapping such that T ( A 0 ) B 0 , and assume that for all u , v , x , y A ,
d ( S u , S T x ) = d ( S v , S T y ) = d ( A , B ) d ( S u , S v ) β ( d ( S x , S y ) ) d ( S x , S y ) ,
where β Γ (that is, T is an S-proximal Geraghty contraction).Then there exists a unique x * A such that
d ( S x * , S T x * ) = d ( A , B ) .
Moreover, if { x n } A is a sequence satisfying
d ( S x n + 1 , S T x n ) = d ( A , B ) , n N ,
then x n x * .
Proof. 
We first introduce the images of the proximity sets under S:
S ( A 0 ) : = { S x d ( S x , S y ) = d ( A , B ) for some y B } ,
S ( B 0 ) : = { S y d ( S x , S y ) = d ( A , B ) for some x A } .
Let x 0 A 0 . Since T ( A 0 ) B 0 , we have T x 0 B 0 and hence S T x 0 S ( B 0 ) . Thus, there exists x 1 A 0 with
d ( S x 1 , S T x 0 ) = d ( A , B ) .
Iterating this construction, we obtain a sequence { x n } A 0 such that
d ( S x n + 1 , S T x n ) = d ( A , B ) , n N .
Set
d n : = d ( S x n , S x n 1 ) , n 1 .
For each n 1 , apply the S-proximal Geraghty condition with
u = x n + 1 , x = x n , v = x n , y = x n 1 .
Then, by (3),
d ( S u , S T x ) = d ( S x n + 1 , S T x n ) = d ( A , B ) , d ( S v , S T y ) = d ( S x n , S T x n 1 ) = d ( A , B ) ,
so the hypothesis is satisfied and we obtain
d ( S x n + 1 , S x n ) β d ( S x n , S x n 1 ) d ( S x n , S x n 1 ) ,
that is,
d n + 1 β ( d n ) d n , n 1 .
By the standard argument in Geraghty’s fixed point theorem (see [9]), (4) implies that d n 0 and that { S x n } is a Cauchy sequence in X. Since X is complete and A 0 is closed, there exists v A 0 such that
lim n S x n = v .
Because S is subsequentially convergent, { x n } has a subsequence { x n ( k ) } converging to some u A 0 . By continuity of S,
lim k S x n ( k ) = S u .
Comparing with (5), we conclude S u = v .
We claim u is the unique best proximity point of T. Since u A 0 and T ( A 0 ) B 0 , there exists y * A 0 with d ( S y * , S T u ) = d ( A , B ) . Combining this with (3) for the subsequence { x n ( k ) } , we have
d ( S y * , S T u ) = d ( A , B ) , d ( S x n ( k ) + 1 , S T x n ( k ) ) = d ( A , B ) .
Applying the contractive condition with
u = x n ( k ) + 1 , x = x n ( k ) , v = y * , y = u ,
we obtain
d ( S x n ( k ) + 1 , S y * ) β d ( S x n ( k ) , S u ) d ( S x n ( k ) , S u ) .
Letting k , we obtain d ( S u , S y * ) = 0 , hence S u = S y * . Since S is one-to-one, u = y * . Thus u is a best proximity point of T.
Finally, for uniqueness, suppose x 1 , x 2 A are two distinct best proximity points, so that d ( S x i , S T x i ) = d ( A , B ) for i = 1 , 2 . Applying the contractive condition with u = x 1 , x = x 1 , v = x 2 , y = x 2 gives
d ( S x 1 , S x 2 ) β d ( S x 1 , S x 2 ) d ( S x 1 , S x 2 ) ,
which is impossible unless d ( S x 1 , S x 2 ) = 0 . Hence x 1 = x 2 . □
We emphasize that the assumption of subsequential convergence of S in Theorem 3 cannot be omitted. This is demonstrated by an example (see Example 1 below).
In the next result, we extend the notion of proximal Kannan non-self mappings introduced by Gabeleh [4] to a Geraghty-type setting.
Theorem 4 
(Extended Proximal Kannan–Geraghty of the First Kind). Let ( A , B ) be a pair of nonempty subsets of a complete metric space ( X , d ) such that A 0 and B 0 are nonempty and closed. Let S be an auxiliary function that is continuous on A and B, one-to-one, and subsequentially convergent, with S ( A 0 ) A 0 and S ( B 0 ) B 0 . Suppose T : A B is a mapping with T ( A 0 ) B 0 , and assume that for all u , v , x , y A ,
d ( S u , S T x ) = d ( S v , S T y ) = d ( A , B ) d ( S u , S v ) β d ( S x , S y ) d * ( S x , S T x ) + d * ( S y , S T y ) ,
where β Γ and
d * ( S x , S T x ) : = d ( S x , S T x ) d ( A , B ) 0 .
Then there exists a unique point x * A such that
d ( S x * , S T x * ) = d ( A , B ) .
Moreover, if { x n } A is a sequence satisfying
d ( S x n + 1 , S T x n ) = d ( A , B ) , n N ,
then x n x * .
Proof. 
As before, define
S ( A 0 ) : = { S x d ( S x , S y ) = d ( A , B ) for some y B } , S ( B 0 ) : = { S y d ( S x , S y ) = d ( A , B ) for some x A } .
Let x 0 A 0 . Since T ( A 0 ) B 0 , we have T x 0 B 0 , hence S T x 0 S ( B 0 ) . Thus there exists x 1 A 0 such that
d ( S x 1 , S T x 0 ) = d ( A , B ) .
Proceeding inductively, we obtain a sequence { x n } A 0 with
d ( S x n + 1 , S T x n ) = d ( A , B ) , n N .
Set again d n : = d ( S x n , S x n 1 ) for n 1 . For each n 1 , apply (6) with
u = x n + 1 , x = x n , v = x n , y = x n 1 .
Using (7), we obtain
d ( S x n , S x n + 1 ) β d ( S x n , S x n 1 ) d * ( S x n , S T x n ) + d * ( S x n 1 , S T x n 1 ) .
By the triangle inequality and (7),
d * ( S x n , S T x n ) = d ( S x n , S T x n ) d ( A , B ) d ( S x n , S x n + 1 ) + d ( S x n + 1 , S T x n ) d ( A , B ) = d ( S x n , S x n + 1 ) = d n + 1 .
and similarly d * ( S x n 1 , S T x n 1 ) d ( S x n 1 , S x n ) = d n . Hence
d n + 1 β ( d n ) d n + 1 + d n .
Rearranging,
d n + 1 1 β ( d n ) β ( d n ) d n ,
and therefore
d n + 1 β ( d n ) 1 β ( d n ) d n , n 1 .
Since 0 β ( t ) < 1 for all t, the right-hand side is finite. As in the standard Kannan–Geraghty argument (cf. [9,12]), (8) implies that d n 0 and that { S x n } is a Cauchy sequence in X. Because X is complete and A 0 is closed, there exists v A 0 such that
lim n S x n = v .
Since S is subsequentially convergent, { x n } has a subsequence { x n ( k ) } converging to some u A 0 . By continuity of S,
lim k S x n ( k ) = S u .
Comparing with (9), we conclude S u = v .
We claim u is the unique best proximity point of T. Since u A 0 and T ( A 0 ) B 0 , there exists y * A 0 with d ( S y * , S T u ) = d ( A , B ) . Combining this with (7), for the subsequence { x n ( k ) } we have
d ( S y * , S T u ) = d ( A , B ) , d ( S x n ( k ) + 1 , S T x n ( k ) ) = d ( A , B ) .
Applying the contractive condition (6) with
u = x n ( k ) + 1 , x = x n ( k ) , v = y * , y = u ,
we obtain
d ( S x n ( k ) + 1 , S y * ) β d ( S x n ( k ) , S u ) d * ( S x n ( k ) , S T x n ( k ) ) + d * ( S u , S T u ) .
Letting k and using the convergence of { S x n } , we obtain d ( S u , S y * ) = 0 , hence S u = S y * . Since S is one-to-one, u = y * . Thus u is a best proximity point of T.
Uniqueness follows similarly: if x 1 , x 2 A are both best proximity points, then, using (6) with u = x 1 , x = x 1 , v = x 2 , y = x 2 , we get
d ( S x 1 , S x 2 ) β d ( S x 1 , S x 2 ) [ d * ( S x 1 , S T x 1 ) + d * ( S x 2 , S T x 2 ) ] ,
but both defect terms vanish (since d ( S x i , S T x i ) = d ( A , B ) ), so the right-hand side is zero. Hence S x 1 = S x 2 , and injectivity of S yields x 1 = x 2 . □
Example 1. 
Consider the metric space
X : = { 0 , 1 } × [ 0 , )
with the Euclidean metric. Define
A : = { ( 0 , x ) : x [ 0 , ) } , B : = { ( 1 , y ) : y [ 0 , ) } .
For ( 0 , x ) A and ( 1 , y ) B ,
d ( 0 , x ) , ( 1 , y ) 2 = 1 + ( x y ) 2 ,
so
d ( A , B ) = 1 , A 0 = A , B 0 = B .
Let T : A B be given by
T ( 0 , x ) = ( 1 , 2 x + 1 ) ,
and let S : X X be defined by
S ( x , y ) = ( x , e y ) .
Clearly S is one-to-one, S ( A ) A and S ( B ) B . Moreover, T ( A 0 ) B 0 .
We first note that T has no best proximity point. Indeed, a best proximity point x * = ( 0 , t ) would have to satisfy
d ( 0 , t ) , T ( 0 , t ) = d ( A , B ) = 1 .
However,
d ( 0 , t ) , ( 1 , 2 t + 1 ) 2 = 1 + ( t ( 2 t + 1 ) ) 2 = 1 + ( t + 1 ) 2 > 1
for all t 0 , so no such t exists.
On the other hand, consider the sequence { ( 0 , n ) } n 1 A . We have
S ( 0 , n ) = ( 0 , e n ) ( 0 , 0 ) A ,
so { S ( 0 , n ) } converges in X, but { ( 0 , n ) } has no convergent subsequence in A itself (the second coordinate diverges to + ). Hence S fails to be subsequentially convergent in the sense required by Theorems 3 and 4.
In this example, the S-proximal Geraghty (or Kannan–Geraghty) condition is satisfied only vacuously, since there are no quadruples u , v , x , y A with
d ( S u , S T x ) = d ( S v , S T y ) = d ( A , B ) ,
as one checks directly from the form of S and T. Nevertheless, the lack of subsequential convergence of S is accompanied by the failure of T to admit a best proximity point, showing that the subsequential convergence assumption on S is essential.

3. Application

In image registration and alignment problems, simplified geometric configurations are often used to analyze the behavior of matching schemes; see, for example, [10,11]. Motivated by this viewpoint, we present an explicit non-self alignment mapping on subsets of R 2 in which all assumptions of our main results are verified directly.

3.1. Geometric Setting

Fix δ > 0 and consider the subsets
A = { ( 0 , t ) : t [ 0 , 1 ] } , B = { ( δ , s ) : s [ 0 , 1 ] }
of R 2 endowed with the Euclidean metric d. Since A B is compact, ( A B , d ) is a complete metric space.
For ( 0 , t ) A and ( δ , s ) B ,
d ( 0 , t ) , ( δ , s ) 2 = δ 2 + ( t s ) 2 ,
and this distance equals d ( A , B ) if and only if s = t . Hence
d ( A , B ) = δ , A 0 = A , B 0 = B ,
and both A 0 and B 0 are nonempty and closed.
Define S : A B A B by
S = Id A B .
Then S is continuous, injective, S ( A 0 ) A 0 , S ( B 0 ) B 0 , and trivially subsequentially convergent.

3.2. Definition of the Non-Self Mapping

Let κ ( 0 , 1 ) and define T : A B by
T ( 0 , t ) = ( δ , κ t ) .
Since κ t [ 0 , 1 ] for all t [ 0 , 1 ] , it follows that T ( A 0 ) B 0 .

3.3. Verification of the S-Proximal Geraghty Condition

Let u = ( 0 , u 2 ) , v = ( 0 , v 2 ) , x = ( 0 , x 2 ) , y = ( 0 , y 2 ) A . Assume
d ( S u , S T x ) = d ( A , B ) = δ , d ( S v , S T y ) = d ( A , B ) = δ .
Using S = Id and T ( 0 , t ) = ( δ , κ t ) , these equalities become
d ( 0 , u 2 ) , ( δ , κ x 2 ) = δ , d ( 0 , v 2 ) , ( δ , κ y 2 ) = δ .
Since
d ( 0 , a ) , ( δ , b ) 2 = δ 2 + ( a b ) 2 ,
each equality holds if and only if u 2 = κ x 2 and v 2 = κ y 2 . Thus
S u = ( 0 , κ x 2 ) , S v = ( 0 , κ y 2 ) ,
and hence
d ( S u , S v ) = κ | x 2 y 2 | = κ d ( S x , S y ) .
Define β : [ 0 , ) [ 0 , 1 ) by β ( t ) κ . Since κ < 1 , we have β Γ , and therefore
d ( S u , S v ) β d ( S x , S y ) d ( S x , S y )
holds for all u , v , x , y A satisfying the proximal hypotheses. Hence T is an S-proximal Geraghty contraction.

3.4. Best Proximity Point

By Theorem 3, there exists a unique x * A such that
d ( S x * , S T x * ) = d ( A , B ) = δ .
Writing x * = ( 0 , t ) , we compute
d ( 0 , t ) , ( δ , κ t ) 2 = δ 2 + ( t κ t ) 2 = δ 2 + ( 1 κ ) 2 t 2 .
This equals δ 2 if and only if t = 0 . Therefore,
x * = ( 0 , 0 ) , T x * = ( δ , 0 ) ,
is the unique best proximity pair.

3.5. Convergence of the Proximal Sequence

Let x 0 = ( 0 , t 0 ) A 0 be arbitrary and define { x n } A 0 by
d S x n + 1 , S T x n = d ( A , B ) = δ , n 0 .
With x n = ( 0 , t n ) , this becomes
d ( 0 , t n + 1 ) , ( δ , κ t n ) = δ ,
which implies t n + 1 = κ t n . Thus
t n = κ n t 0 0 , x n x * = ( 0 , 0 ) .

3.6. Kannan–Geraghty Variant

For the setting of Theorem 4, one may take
T ( 0 , t ) = ( δ , 0 ) , t [ 0 , 1 ] .
The proximal conditions again force u = v = ( 0 , 0 ) , and the defining inequality of the proximal Kannan–Geraghty condition holds trivially. The unique best proximity point is again ( 0 , 0 ) .

Author Contributions

Conceptualization, F.F.; methodology, F.F.; formal analysis, F.F.; writing—original draft preparation, F.F.; writing—review and editing, S.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ariza-Ruiz, D.; Jimenez-Melado, A. A continuation method for weakly Kannan maps. Fixed Point Theory Appl. 2010, 2010, Article ID 321594. [Google Scholar] [CrossRef]
  2. Beiranvand, A.; Moradi, S.; Omid, M.; Pazandeh, H. Two fixed-point theorems for special mappings. arXiv 2009, arXiv:0903.1504. [Google Scholar] [CrossRef]
  3. Dugundji, J.; Granas, A. Weakly contractive maps and elementary domain invariance theorem. Bull. Soc. Math. Grèce 1978, 19, 141–151. [Google Scholar]
  4. Gabeleh, M. Existence and uniqueness results for best proximity points. Miskolc Math. Notes 2015, 16, 123–131. [Google Scholar] [CrossRef]
  5. Moradi, S. Kannan fixed-point theorem on complete metric space and on generalized metric space depended on another function. arXiv 2009, arXiv:0903.1577. [Google Scholar] [CrossRef]
  6. Mongkolkeha, C.; Cho, Y.J.; Kumam, P. Best proximity points for Geraghty’s proximal contraction mappings. Fixed Point Theory Appl. 2013, 2013, Article. [Google Scholar] [CrossRef]
  7. Basha, S.S. Best proximity point theorems generalizing the contraction principle. Nonlinear Anal. 2011, 74, 5844–5850. [Google Scholar] [CrossRef]
  8. Sun, Y.; Su, Y.; Zhang, J. A new method for the research of best proximity point theorems of nonlinear mappings. Fixed Point Theory Appl. 2014, 2014, Article ID 116. [Google Scholar] [CrossRef]
  9. Caballero, J.; Harjani, J.; Sadarangani, K. A best proximity point theorem for Geraghty-contractions. Fixed Point Theory Appl. 2012, 2012. [Google Scholar] [CrossRef]
  10. Brown, M.; Lowe, D.G. Automatic panoramic image stitching using invariant features. Int. J. Comput. Vis. 2007, 74, 59–73. [Google Scholar] [CrossRef]
  11. Zitová, B.; Flusser, J. Image registration methods: A survey. Image Vis. Comput. 2003, 21, 977–1000. [Google Scholar] [CrossRef]
  12. Fogh, F.; Behnamian, S.; Pashaie, F. On Kannan–Geraghty maps as an extension of Kannan maps. Int. J. Maps Math. 2019, 2, 1–13. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated