### 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 language | English (US) |
---|---|

Pages (from-to) | 21-24 |

Number of pages | 4 |

Journal | Pattern Recognition Letters |

Volume | 1 |

Issue number | 1 |

DOIs | |

State | Published - 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.

Research output: Contribution to journal › Article

*Pattern Recognition Letters*, vol. 1, no. 1, pp. 21-24. https://doi.org/10.1016/0167-8655(82)90046-0

}

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 -