Given a set V of n vectors in d-dimensional space, we provide an efficient method for computing quality upper and lower bounds of the Euclidean distances between a pair of vectors in V . For this purpose, we define a distance measure, called the MS-distance, by using the mean and the standard deviation values of vectors in V . Once we compute the mean and the standard deviation values of vector...

to assess the genetic diversity for morphological and agronomic traits in iranian oriental tobacco germplasm,100 oriental and semi-oriental tobacco genotypes from the urmieh tobacco research center collection were evaluated in the field using a simple square lattice design with two replications. some agronomic traits were measured on five randomly selected plants in each plot. genotypes were cl...

A distance matrix D of order n is symmetric with elements idfj, where d,, = 0. D is Euclidean when the in(n 1) quantities dij can be generated as the distances between a set of n points, X (n X p), in a Euclidean space of dimension p. The dimensionality of D is defined as the least value of p = rank(X) of any generating X; in general p + 1 and p +2 are also acceptable but may include imaginary ...

1. SUMMARY Time-series, or time-sequence, data show the value of a parameter over time. A common query with time-series data is to find all sequences which are similar to a given sequence. The most common technique for evaluating similarity between two sequences involves calculating the Euclidean distance between them. However, many examples can be given where two similar sequences are separate...

Based on a two-component descriptor, a distance label for each point, it is shown that Euclidean distance maps can be generated by effective sequential algorithms. The map indicates, for each pixel in the objects (or the background) of the originally binary picture, the shortest distance to the nearest pixel in the background (or the objects). A map with negligible errors can be produced in two...

The use of development threat as a tool in conservation prioritization is becoming increasingly common. When used as a component of a larger planning methodology that may include factors such as biological integrity, area, and connectivity, degree of threat may help an organization to protect a larger amount of land that it would otherwise have been able to. I develop two models of development:...

In this article, we propose to investigate the extension of the SEDT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We give two algorithms to handle different structurations of grids. We first describe a simple approach based on the complete Voronoi diagram of the background irregular pixels, very fast on sparse grids. Then, we extend the separable algorithm defined o...

Thinning is one of the most frequently used methods to know the geometrical feature of objects. It also provides the topological feature and length measurements about an object. For example, the tree structure of the bronchus is determined by using the thinned result of it. This paper presents a three dimensional thinning method which can control the quality of result concerning appearance of s...

Fermat-Weber problem in its simple form (unconstrained, single facility, Euclidean metric) is well investigated. Lot of algorithms are also developed for more complicated cases. But the generalized multi-facility problem with barriers, restricted zones and an arbitrary metric has no well-known algorithm for its solving. In this paper, we consider the planar multi-facility Weber problem with res...