A historical note on convex hull finding algorithms

Research output: Contribution to journalArticle

Abstract

Most of the progress made on the convex hull problem has been accomplished during and after the late 1970's. In the convex hull literature to date, Graham (1972) is credited with the first optimal O(n log n) algorithm for computing the convex hull of n points on the plane. In this note we bring to light a hidden and forgotten convex hull algorithm due to Bass and Schubert (1967). Although their description of the algorithm is somewhat vague and, as described, their algorithm is incorrect, it is shown here that their procedure nevertheless contains most of the key ideas that have appeared in the convex hull literature in recent years. Finally, although the authors did not provide either a proof of correctness or a complexity analysis, it is shown here that a suitable interpretation of their algorithm runs correctly in O(n log n) time and thus predates Graham's algorithm by five years.

Original languageEnglish (US)
Pages (from-to)21-28
Number of pages8
JournalPattern Recognition Letters
Volume3
Issue number1
DOIs
StatePublished - Jan 1 1985

Keywords

  • Algorithms
  • complexity
  • computational geometry
  • convex hull
  • monotone polygons
  • pattern recognition

ASJC Scopus subject areas

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

Cite this

A historical note on convex hull finding algorithms. / Toussaint, Godfried.

In: Pattern Recognition Letters, Vol. 3, No. 1, 01.01.1985, p. 21-28.

Research output: Contribution to journalArticle

@article{a625bb67941c4f98a5c65c91e47d001d,
title = "A historical note on convex hull finding algorithms",
abstract = "Most of the progress made on the convex hull problem has been accomplished during and after the late 1970's. In the convex hull literature to date, Graham (1972) is credited with the first optimal O(n log n) algorithm for computing the convex hull of n points on the plane. In this note we bring to light a hidden and forgotten convex hull algorithm due to Bass and Schubert (1967). Although their description of the algorithm is somewhat vague and, as described, their algorithm is incorrect, it is shown here that their procedure nevertheless contains most of the key ideas that have appeared in the convex hull literature in recent years. Finally, although the authors did not provide either a proof of correctness or a complexity analysis, it is shown here that a suitable interpretation of their algorithm runs correctly in O(n log n) time and thus predates Graham's algorithm by five years.",
keywords = "Algorithms, complexity, computational geometry, convex hull, monotone polygons, pattern recognition",
author = "Godfried Toussaint",
year = "1985",
month = "1",
day = "1",
doi = "10.1016/0167-8655(85)90038-8",
language = "English (US)",
volume = "3",
pages = "21--28",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - A historical note on convex hull finding algorithms

AU - Toussaint, Godfried

PY - 1985/1/1

Y1 - 1985/1/1

N2 - Most of the progress made on the convex hull problem has been accomplished during and after the late 1970's. In the convex hull literature to date, Graham (1972) is credited with the first optimal O(n log n) algorithm for computing the convex hull of n points on the plane. In this note we bring to light a hidden and forgotten convex hull algorithm due to Bass and Schubert (1967). Although their description of the algorithm is somewhat vague and, as described, their algorithm is incorrect, it is shown here that their procedure nevertheless contains most of the key ideas that have appeared in the convex hull literature in recent years. Finally, although the authors did not provide either a proof of correctness or a complexity analysis, it is shown here that a suitable interpretation of their algorithm runs correctly in O(n log n) time and thus predates Graham's algorithm by five years.

AB - Most of the progress made on the convex hull problem has been accomplished during and after the late 1970's. In the convex hull literature to date, Graham (1972) is credited with the first optimal O(n log n) algorithm for computing the convex hull of n points on the plane. In this note we bring to light a hidden and forgotten convex hull algorithm due to Bass and Schubert (1967). Although their description of the algorithm is somewhat vague and, as described, their algorithm is incorrect, it is shown here that their procedure nevertheless contains most of the key ideas that have appeared in the convex hull literature in recent years. Finally, although the authors did not provide either a proof of correctness or a complexity analysis, it is shown here that a suitable interpretation of their algorithm runs correctly in O(n log n) time and thus predates Graham's algorithm by five years.

KW - Algorithms

KW - complexity

KW - computational geometry

KW - convex hull

KW - monotone polygons

KW - pattern recognition

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

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

U2 - 10.1016/0167-8655(85)90038-8

DO - 10.1016/0167-8655(85)90038-8

M3 - Article

AN - SCOPUS:0039807327

VL - 3

SP - 21

EP - 28

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 1

ER -