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

Godfried Toussaint, Jim A. McAlear

Research output: Contribution to journalArticle

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).

Original languageEnglish (US)
Pages (from-to)21-24
Number of pages4
JournalPattern Recognition Letters
Volume1
Issue number1
DOIs
StatePublished - Jan 1 1982

Keywords

  • algorithms
  • cluster analysis
  • convex hull
  • diameter
  • Distance between sets
  • geometric complexity
  • pattern recognition

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets. / Toussaint, Godfried; McAlear, Jim A.

In: Pattern Recognition Letters, Vol. 1, No. 1, 01.01.1982, p. 21-24.

Research output: Contribution to journalArticle

@article{0173ba5735f64de7993d0446f9c063c6,
title = "A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets",
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).",
keywords = "algorithms, cluster analysis, convex hull, diameter, Distance between sets, geometric complexity, pattern recognition",
author = "Godfried Toussaint and McAlear, {Jim A.}",
year = "1982",
month = "1",
day = "1",
doi = "10.1016/0167-8655(82)90046-0",
language = "English (US)",
volume = "1",
pages = "21--24",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

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

AU - Toussaint, Godfried

AU - McAlear, Jim A.

PY - 1982/1/1

Y1 - 1982/1/1

N2 - 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).

AB - 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).

KW - algorithms

KW - cluster analysis

KW - convex hull

KW - diameter

KW - Distance between sets

KW - geometric complexity

KW - pattern recognition

UR - http://www.scopus.com/inward/record.url?scp=0020375306&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020375306&partnerID=8YFLogxK

U2 - 10.1016/0167-8655(82)90046-0

DO - 10.1016/0167-8655(82)90046-0

M3 - Article

VL - 1

SP - 21

EP - 24

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 1

ER -