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

Godfried T. Toussaint

doi:10.1016/0167-8655(82)90017-4

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

Godfried T. Toussaint

Computer Science

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	85-86
Number of pages	2
Journal	Pattern Recognition Letters
Volume	1
Issue number	2
DOIs	https://doi.org/10.1016/0167-8655(82)90017-4
State	Published - Dec 1982

Keywords

Convex polygon
computational geometry
extremal problems

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition
Artificial Intelligence

Access to Document

10.1016/0167-8655(82)90017-4

Cite this

@article{bd93100b0d11440a90bdf3d8084b86cd,

title = "A simple proof of Pach's extremal theorem for convex polygons",

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.",

keywords = "Convex polygon, computational geometry, extremal problems",

author = "Toussaint, {Godfried T.}",

year = "1982",

month = dec,

doi = "10.1016/0167-8655(82)90017-4",

language = "English (US)",

volume = "1",

pages = "85--86",

journal = "Pattern Recognition Letters",

issn = "0167-8655",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

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

AU - Toussaint, Godfried T.

PY - 1982/12

Y1 - 1982/12

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

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

KW - Convex polygon

KW - computational geometry

KW - extremal problems

UR - http://www.scopus.com/inward/record.url?scp=49049142468&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049142468&partnerID=8YFLogxK

U2 - 10.1016/0167-8655(82)90017-4

DO - 10.1016/0167-8655(82)90017-4

M3 - Article

AN - SCOPUS:49049142468

SN - 0167-8655

VL - 1

SP - 85

EP - 86

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

IS - 2

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this