Minimum area circumscribing Polygons

Alok Aggarwal, J. S. Chang, Chee K. Yap

Research output: Contribution to journalArticlepeer-review


We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n2 log n log k) time.

Original languageEnglish (US)
Pages (from-to)112-117
Number of pages6
JournalThe Visual Computer
Issue number2
StatePublished - Aug 1985


  • Circumscribing
  • Convex polygons
  • Geometric algorithms
  • Minimum area
  • Optimization

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this