Polygon vertex extremality and decomposition of polygons

DOI10.1016/J.DISC.2010.04.015MaRDI QIDQ708361zbMATH OpenOpenAlexFDO

Authors Wiktor J. Mogilski

Publication date 11 October 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.1852

zbMATH Keywords

decomposition of polygonsdiscrete curvaturediscrete four-vertex theoremextremal verticesglobal extremalitylocal extremality

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25)

Abstract: In this paper, we show that if we decompose a polygon into two smaller polygons, then by comparing the number of extremal vertices in the original polygon versus the sum of the two smaller polygons, we can gain at most two globally extremal vertices in the smaller polygons, as well as at most two locally extremal vertices. We then will derive two discrete Four-Vertex Theorems from our results.

Recommendations

• scientific article; zbMATH DE number 2197927
• A Four Vertex Theorem for Polygons
• Curvature extrema and four-vertex theorems for polygons and polyhedra
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• scientific article; zbMATH DE number 3986641

Cites work

• Curvature extrema and four-vertex theorems for polygons and polyhedra
• On the number of circles of curvature perfectly enclosing or perfectly enclosed by a closed convex oval

Cited in

(2)

• Finding Extremal Polygons
• scientific article; zbMATH DE number 6258433 (Why is no real title available?)

This page was built for publication: Polygon vertex extremality and decomposition of polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708361)