COMPUTING THE DIAMETER OF A POINT SET
نویسندگان
چکیده
منابع مشابه
Computing the Diameter of a Point Set
Given a finite set of points P in R, the diameter of P is defined as the maximum distance between two points of P. We propose a very simple algorithm to compute the diameter of a finite set of points. Although the algorithm is not worst-case optimal, an extensive experimental study has shown that it is extremely fast for a large variety of point distributions. In addition, we propose a comparis...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملOn Computing the Diameter of a Point Set in High Dimensional Euclidean Space
We consider the problem of computing the diameter of a set of n points in d-dimensional Euclidean space under Euclidean distance function. We describe an algorithm that in time O(dn log n + n 2) nds with high probability an arbitrarily close approximation of the diameter. For large values of d the complexity bound of our algorithm is a substantial improvement over the complexity bounds of previ...
متن کاملON THE h-DIAMETER OF A RANDOM POINT SET
Let S ∑ be a measurable space and let h : S S R be a real symmetric Borel/∑ ∑measurable function on S S. Let B be a non-empty measurable subset in S and let μ be a probability measure supported on the restriction of the measurable space S ∑ to B. Let B have finite h-diameter h ess sup h u v : u v B ∞ Let U U1 U2 .... be a sequence of independent random points taking values in B according to μ a...
متن کاملComputing the width of a point set in 3-space
We present a new algorithm to solve the 3-dimensional width problem, i.e. to determine two parallel planes of smallest distance such that the region between the two planes contains a given point set. Like the algorithm of Houle and Toussaint, our method has quadratic worstcase complexity but is much faster in practice. In contrast to Houle and Toussaint, we do not use plane sweep or point locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2002
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195902001006