Efficient approximation of convex polygons

Mario A. Lopez, Shlomo Reisner

Research output: Contribution to journalArticlepeer-review


We present algorithms for the approximation of a convex n-gon by a convex k-gon (k < n) which inscribes or circumscribes the original polygon. Our algorithms run in O (n + (n - k) log n) time and are easy to implement. Their accuracy, in the sense of area-difference, is analyzed and shown to be of the best order possible for a general algorithm. In particular, this analysis settles a question raised by O'Rourke on the performance of the approximation algorithm of Dori and Ben-Bassat.

Original languageEnglish
Pages (from-to)445-452
Number of pages8
JournalInternational Journal of Computational Geometry and Applications
Issue number5
StatePublished - Oct 2000


  • Approximation algorithms
  • Convex polygon

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Efficient approximation of convex polygons'. Together they form a unique fingerprint.

Cite this