Convexification of polygons by flips and by flipturns (Q5951945): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126844181, #quickstatements; #temporary_batch_1719269348057 |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(01)00152-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2023891195 / rank | |||
Normal rank |
Latest revision as of 10:15, 30 July 2024
scientific article; zbMATH DE number 1687471
Language | Label | Description | Also known as |
---|---|---|---|
English | Convexification of polygons by flips and by flipturns |
scientific article; zbMATH DE number 1687471 |
Statements
Convexification of polygons by flips and by flipturns (English)
0 references
11 November 2002
0 references
The authors generalize the known result that every simple polygon can be convexified by a finite number of flips, or of flipturns, to the following class of more general polygons: A polygon is a sequence of \(n \geq 2\) points \(V_i\) in the Euclidean plane and closed segments \(V_iV_{i+1}\) with \(V_{n+1}=V_1\) and \(V_i \neq V_{i+1}\) for all \(i\). The result of the convexification, obviously, is only a ``weakly convex'' or a ``nearly convex'' polygon which is contained in the boundary of its convex hull or which is a subdivision of a segment.
0 references
polygon
0 references
convexification
0 references