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.

We discuss in this paper a method of finding skyline or non-dominated points in a set P of nP points with respect to a set S of nS sites. A point pi ∈ P is non-dominated if and only if for each pj ∈ P , j 6= i, there exists at least one point s ∈ S that is closer to pi than pj . We reduce this problem of determining non-dominated points to the problem of finding sites that have non-empty cells ...

We are given m pursuers and one evader. Each pursuer and the evader has an associated starting point in the plane, a maximum speed, and a start time. We also have a set of line segment obstacles with a total of n endpoints. Our task is to find those points in the plane, called the evader’s region, that the evader can reach via evasive paths. A path is evasive if the evader can traverse the path...

An α-complex is a subcomplex of the Delaunay triangulation of a point set P ⊂ R that is topologically equivalent to the union of balls of radius α centered at the points of P . In this paper, we give an output-sensitive algorithm to compute α-complexes of n-point sets in constant dimensions, whose running time is O(f log n log αs ), where s is the smallest pairwise distance and f is the number ...

We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...

Voronoi diagram is a typical partitioning of plane according to number given points on the referred as generators, based Euclidean distances from points. In current study, generalization such voronoi discussed viewpoint various consideration distance. On basis discrete decomposition approach, we take into account distance metrics other than conventional The existence pathway network shorten giv...

Clustering is a basic tool in unsupervised machine learning and data mining. Distance-based clustering algorithms rarely have the means to autonomously come up with the correct number of clusters from the data. A recent approach to identifying the natural clusters is to compare the point densities in different parts of the sample space. In this paper we put forward an agglomerative clustering a...

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...

We discuss the problem of finding an upper bound for the number of equilibrium points of a potential of several fixed point charges in Rn. This question goes back to J. C. Maxwell and M. Morse. Using fewnomial theory we show that for a given number of charges there exists an upper bound independent of the dimension, and show it to be at most 12 for three charges. We conjecture an exact upper bo...

The Most Likely Voronoi Diagram is a generalization of the well known Voronoi Diagrams to a stochastic setting, where a stochastic point is a point associated with a given probability of existence, and the cell for such a point is the set of points which would classify the given point as its most likely nearest neighbor. We investigate the complexity of this subdivision of space in d dimensions...