Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

COMPGEOM
2001
ACM

favoriteEmaildiscussreport

92views Discrete Geometry» more COMPGEOM 2001»

A practical approach for computing the diameter of a point set

13 years 8 months ago

A practical approach for computing the diameter of a point set

Download valis.cs.uiuc.edu

We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diameter of the given input, and for most inputs it is able to compute the exact diameter extremely fast. The new algorithm is simple, robust, has good empirical performance, and can be implemented quickly. As such, it seems to be the algorithm of choice in practice for computing/approximating the diameter.

Sariel Har-Peled

Real-time Traffic

Algorithm | Approximation Algorithm | COMPGEOM 2001 | Discrete Geometry | Exact Diameter |

claim paper

Related Content

» Improved Approximation Bounds for Planar Point Pattern Matching

» Texture Atlas Generation for Inconsistent Meshes and Point Sets

» Dynamic algorithms for geometric spanners of small diameter Randomized solutions

» The Core Skills Trainer A Set of Haptic Games for Practicing Key Clinical Skills

» Randomized and deterministic algorithms for geometric spanners of small diameter

» Enhanced Diameter Bounding via Structural

» Efficient reconstruction from nonuniform point sets

» Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure

» Approximating Center Points with Iterated Radon Points

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2001
Where	COMPGEOM
Authors	Sariel Har-Peled

Comments (0)