A Practical Approach for Computing the Diameter of a Point Set
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908367316844544 |
|---|---|
| author | Har-Peled, Sariel |
| author_facet | Har-Peled, Sariel |
| contents | We present an approximation algorithm for computing the diameter of a point-set in $\Re^d$. 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_11317 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Practical Approach for Computing the Diameter of a Point Set Har-Peled, Sariel Computational Geometry We present an approximation algorithm for computing the diameter of a point-set in $\Re^d$. 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. |
| title | A Practical Approach for Computing the Diameter of a Point Set |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2505.11317 |