A counter-example to a convex hull algorithm for polygons

Godfried Toussaint

Research output: Contribution to journalArticlepeer-review


A linear-time algorithm was recently published (Pattern Recognition 22, 561-565, 1989) for computing the convex hull of a simple polygon. In this note we present a counter-example to that algorithm.

Original languageEnglish (US)
Pages (from-to)183-184
Number of pages2
JournalPattern Recognition
Issue number2
StatePublished - 1991


  • Computational geometry
  • Convex hull
  • Geometric complexity
  • Simple polygon

ASJC Scopus subject areas

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


Dive into the research topics of 'A counter-example to a convex hull algorithm for polygons'. Together they form a unique fingerprint.

Cite this