Time- and storage-efficient implementation of an optimal planar convex hull algorithm

BK Bhattacharya, GT Toussaint

Research output: Contribution to journalArticlepeer-review


An implementation of an algorithm for computing the convex hull of a finite planar set of points is presented. The program is compared with an algorithm for the same purpose coded previously. Experimental results indicate that our program is superior to the other in terms of both running time and storage requirements.

Original languageEnglish (US)
Pages (from-to)140-144
Number of pages5
JournalImage and Vision Computing
Issue number3
StatePublished - Aug 1983


  • algorithm
  • computational geometry
  • convex hull
  • expected complexity

ASJC Scopus subject areas

  • Signal Processing
  • Computer Vision and Pattern Recognition

Cite this