Abstract
We apply the partition technique to build an efficient approximation algorithm to compute the diameter of a set of points in 2D Euclidean plane. The optimal time of our algorithm is O(N + (1/δ)log(1/δ)), up to a (1 + δ) factor, for 2-dimensional N-point set. The error bounds are proved strictly. Compared to the prior works, our algorithm is without complex data structure and easy to be implanted. The partition technique is general and may be applied in higher-dimensional space.
| Original language | English |
|---|---|
| Article number | 022035 |
| Journal | Journal of Physics: Conference Series |
| Volume | 1087 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2 Oct 2018 |
| Event | 1st International Conference on Advanced Algorithms and Control Engineering, ICAACE 2018 - Pingtung, Taiwan, Province of China Duration: 10 Aug 2018 → 12 Aug 2018 |
Fingerprint
Dive into the research topics of 'Efficient Approximation Algorithm with Partition Technique for the Diameter of A Set of Points in 2D Plane'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver