Skip to main navigation Skip to search Skip to main content

Efficient Approximation Algorithm with Partition Technique for the Diameter of A Set of Points in 2D Plane

  • Beihang University
  • ESSEC Business School

Research output: Contribution to journalConference articlepeer-review

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 languageEnglish
Article number022035
JournalJournal of Physics: Conference Series
Volume1087
Issue number2
DOIs
StatePublished - 2 Oct 2018
Event1st International Conference on Advanced Algorithms and Control Engineering, ICAACE 2018 - Pingtung, Taiwan, Province of China
Duration: 10 Aug 201812 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