Convexity of Sub-polygons of Convex Polygons
From MaRDI portal
Publication:6477922
arXivmath/0609698MaRDI QIDQ6477922FDOQ6477922
Authors: Iosif Pinelis 
Publication date: 25 September 2006
Abstract: A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices {V_0,...,V_{n-1}}. It is proved that all sub-polygons of any convex polygon with distinct vertices are convex. It is also proved that, if all sub-(n-1)-gons of an n-gon with nge5 are convex, then the n-gon is convex. Other related results are given.
Generalized quadrangles and generalized polygons in finite geometry (51E12) Convex sets in (2) dimensions (including convex curves) (52A10) Other problems of combinatorial convexity (52A37)
This page was built for publication: Convexity of Sub-polygons of Convex Polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477922)
