A simple proof of Pach's Extremal Theorem for convex polygons

被引：1

作者：

Toussaint, Godfried T. ^{[1
]}

机构：

[1] McGill Univ, Sch Comp Sci, Montreal, PQ, Canada

来源：

PATTERN RECOGNITION LETTERS | 1982年 / 1卷 / 02期

关键词：

Convex polygon; extremal problems; computational geometry;

D O I：

10.1016/0167-8655(82)90017-4

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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

引用

页码：85 / 86

页数：2

共 12 条

[1] Extremal convex polygons inscribed in a given convex polygon
Kodmon, Csenge Lili
Langi, Zsolt
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2022, 102
[2] The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
Iwerks, Justin
Mitchell, Joseph S. B.
INFORMATION PROCESSING LETTERS, 2012, 112 (20) : 778 - 782
[3] Around the Proof of the Legendre–Cauchy Lemma on Convex Polygons
I. Kh. Sabitov
Siberian Mathematical Journal, 2004, 45 : 740 - 762
[4] A simple linear algorithm for intersecting convex polygons
Toussaint, Godfried T.
VISUAL COMPUTER, 1985, 1 (02): : 118 - 123
[5] Around the proof of the Legendre-Cauchy lemma on convex polygons
Sabitov, IK
SIBERIAN MATHEMATICAL JOURNAL, 2004, 45 (04) : 740 - 762
[6] A Discrete Blaschke Theorem for Convex Polygons in 2-Dimensional Space Forms
Borisenko, Alexander
Miquel, Vicente
JOURNAL OF MATHEMATICAL PHYSICS ANALYSIS GEOMETRY, 2024, 20 (02) : 195 - 204
[7] Shortest zookeeper's routes in simple polygons
Tan, XH
INFORMATION PROCESSING LETTERS, 2001, 77 (01) : 23 - 26
[8] Hilbert's Proof of His Irreducibility Theorem
Villarino, Mark B.
Gasarch, William
Regan, Kenneth W.
AMERICAN MATHEMATICAL MONTHLY, 2018, 125 (06): : 513 - 530
[9] Proof of David Kendall’s conjecture concerning the shape of large random polygons
I. N. Kovalenko
Cybernetics and Systems Analysis, 1997, 33 : 461 - 467
[10] Proof of David Kendall's conjecture concerning the shape of large random polygons
Kovalenko, IN
CYBERNETICS AND SYSTEMS ANALYSIS, 1997, 33 (04) : 461 - 467

← 1 2 →