Abstract
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.
| Original language | English (US) |
|---|---|
| Pages | 177-185 |
| Number of pages | 9 |
| DOIs | |
| State | Published - 2001 |
| Event | 17th Annual Symposium on Computational Geometry (SCG'01) - Medford, MA, United States Duration: Jun 3 2001 → Jun 5 2001 |
Other
| Other | 17th Annual Symposium on Computational Geometry (SCG'01) |
|---|---|
| Country/Territory | United States |
| City | Medford, MA |
| Period | 6/3/01 → 6/5/01 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics