in this paper, using the best proximity theorems for an extensionof brosowski's theorem. we obtain other results on farthest points. finally, wedene the concept of e- farthest points. we shall prove interesting relationshipbetween the -best approximation and the e-farthest points in normed linearspaces (x; ||.||). if z in w is a e-farthest point from an x in x, then z is also a-best ...

in this paper we obtain a necessary and a sufficient condition for the set of ω_0-nearest points ( ω_0-farthest points) to be non-empty or a singleton set in normed linear spaces. we shall find a necessary and a sufficient condition for an uniquely remotal set to be a singleton set.

In this paper, using the best proximity theorems for an extensionof Brosowski's theorem. We obtain other results on farthest points. Finally, wedene the concept of e- farthest points. We shall prove interesting relationshipbetween the -best approximation and the e-farthest points in normed linearspaces (X; ||.||). If z in W is a e-farthest point from an x in X, then z is also a-best approximati...

Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points. We introduce network farthest-point diagrams, which capture how the farthest points—and the distan...

Let (X,N) be a fuzzy normed space. For each 0 < < 1 and a non-empty subset A of X, we define a natural notion for -farthest points from A and a set-valued map x 7→ Q (A, x), called the fuzzy -farthest point map. Then we will investigate basic properties of the fuzzy -farthest point mapping. In particular, we show that the fuzzy -farthest point map is closable.

We introduce the Fast Marching farthest point sampling (FastFPS) approach for the progressive sampling of planar domains and curved manifolds in triangulated, point cloud or implicit form. By using Fast Marching methods2, 3, 6 for the incremental computation of distance maps across the sampling domain, we obtain a farthest point sampling technique superior to earlier point sampling principles i...

Consider the continuum of points along the edges of a network, an embedded undirected graph with positive edge weights. Distance between these points can be measured as shortest path distance along the edges of the network. We introduce two new concepts to capture farthest-point information in this metric space. The first, eccentricity diagrams, are used to encode the distance towards farthest ...

1 The farthest-point Voronoi diagram of a set of n sites 2 is a tree with n leaves. We investigate whether arbi3 trary trees can be realized as farthest-point Voronoi di4 agrams. Given an abstract ordered tree T with n leaves 5 and prescribed edge lengths, we produce a set of n sites 6 S in O(n) time such that the farthest-point Voronoi di7 agram of S represents T . We generalize this algorithm...