Convexity of Sub-polygons of Convex Polygons

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…