A simple proof of Pach's extremal theorem for convex polygons

Research output: Contribution to journalArticle

Abstract

A simple proof is given that the minimum-area triangle inscribed in a convex polygon has two sides which are edges of the polygon.

Original languageEnglish (US)
Pages (from-to)85-86
Number of pages2
JournalPattern Recognition Letters
Volume1
Issue number2
DOIs
StatePublished - Dec 1982

Keywords

  • Convex polygon
  • computational geometry
  • extremal problems

ASJC Scopus subject areas

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

Cite this