«Farthest point»
۴۱۹ نتیجهOn co-Farthest Points in Normed Linear Spaces
In this paper, we consider the concepts co-farthest points in normed linear spaces. At first, we define farthest points, farthest orthogonality in normed linear spaces. Then we define co-farthest points, co-remotal sets, co-uniquely sets and co-farthest maps. We shall prove some
ω_0-nearest points and ω_0-farthest point in normed linear spaces
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 s
Network Farthest-Point Diagrams
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 stud
Analysis of farthest point sampling for approximating geodesics in a graph
A standard way to approximate the distance between any two vertices p and q on a mesh is to compute, in the associated graph, a shortest path from p to q that goes through one of k sources, which are well-chosen vertices. Precomputing the distance between each of the k sources to
Fast Marching farthest point sampling
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 acro
Design of Farthest-Point Masks for Image Halftoning
In an earlier paper, we briefly presented a new halftoning algorithm called farthest-point halftoning. In the present paper, this method is analyzed in detail, and a novel dispersion measure is defined to improve the simplicity and flexibility of the result. This new stochastic s
Fast Marching farthest point sampling for point clouds and implicit surfaces
In a recent paper [13], the Fast Marching farthest point sampling strategy (FastFPS) for planar domains and curved manifolds was introduced. The version of FastFPS for curved manifolds discussed in the paper [13] deals with surface domains in triangulated form only. Due to a rest
Fast Marching farthest point sampling for implicit surfaces and point clouds
In a recent paper [13], the Fast Marching farthest point sampling strategy (FastFPS) for planar domains and curved manifolds was introduced. The version of FastFPS for curved manifolds discussed in the paper [13] deals with surface domains in triangulated form only. Due to a rest
The farthest point strategy for progressive image sampling
A new method of farthest point strategy (FPS) for progressive image acquisition-an acquisition process that enables an approximation of the whole image at each sampling stage-is presented. Its main advantage is in retaining its uniformity with the increased density, providing eff
On Farthest-Point Information in Networks
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