Convexity of Sub-polygons of Convex Polygons
Iosif Pinelis
Abstract
A convex polygon is defined as a sequence (V0,...,Vn-1) of points on a plane such that the union of the edges [V0,V1],..., [Vn-2,Vn-1], [Vn-1,V0] coincides with the boundary of the convex hull of the set of vertices V0,...,Vn-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 n5 are convex, then the n-gon is convex. Other related results are given.
Create a lesson
Related papers
A Note on the Measure of Vector and Pythagorean Theorem
Yu. V. Brezhnev
On Weighted Convex Graphs
Angshuman R. Goswami
On characterizations, Decompositions, and Stability of Convex Sequences
Angshuman R. Goswami
New Laplace convolution integrals involving exponential, error, and parabolic cylinder functions with applications in heat transfer and linear viscoelasticity
González Santander, Juan Luis
Resolution of Singularities in Positive Characteristic: Frobenius-Hasse Towers and Exceptional-History Descent
Chenxiao Tian
Information Geometry (IG) Lives at Edge or Boundary of SMG (statistically meaningful geometry): - the First Edge Theorem and Applications
Bing Cheng, Yi-Shuai Niu, Howell Tong et al.