A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets

  • Authors:

  • Godfried T Toussaint;Jim A Mcalear

  • Affiliations:

  • School of Computer Science, McGill Univeristy, Montreal, Quebec, Canada;School of Computer Science, McGill Univeristy, Montreal, Quebec, Canada

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 1982

Quantified Score

Hi-index 0.10

Visualization

Abstract

A simple O(n log n) algorithm is presented for computing the maximum Euclidean distance between two finite planar sets of n points. When the n points form the vertices of simple polygons this complexity reduces to O(n).