GetWiki
convex polygon
ARTICLE SUBJECTS
being →
database →
ethics →
fiction →
history →
internet →
language →
linux →
logic →
method →
news →
policy →
purpose →
religion →
science →
software →
truth →
unix →
wiki →
ARTICLE TYPES
essay →
feed →
help →
system →
wiki →
ARTICLE ORIGINS
critical →
forked →
imported →
original →
convex polygon
please note:
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{Short description|Polygon that is the boundary of a convex set}}File:Pentagon.svg|right|thumb|190px|An example of a convex polygon: a regular pentagon.]]In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is contained in the union of the interior and the boundary of the polygon. In particular, it is a simple polygon (not self-intersecting).Definition and properties of convex polygons with interactive animation. Equivalently, a polygon is convex if every line that does not contain any edge intersects the polygon in at most two points.A strictly convex polygon is a convex polygon such that no line contains two of its edges. In a convex polygon, all interior angles are less than or equal to 180 degrees, while in a strictly convex polygon all interior angles are strictly less than 180 degrees.- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
Properties
The following properties of a simple polygon are all equivalent to convexity:- Every internal angle is less than or equal to 180 degrees.
- Every point on every line segment between two points inside or on the boundary of the polygon remains inside or on the boundary.
- The polygon is entirely contained in a closed half-plane defined by each of its edges.
- For each edge, the interior points are all on the same side of the line that the edge defines.
- The angle at each vertex contains all other vertices in its edges and interior.
- The polygon is the convex hull of its edges.
- The intersection of two convex polygons is a convex polygon.
- A convex polygon may be triangulated in linear time through a fan triangulation, consisting in adding diagonals from one vertex to all other vertices.
- Helly’s theorem: For every collection of at least three convex polygons: if all intersections of all but one polygon are nonempty, then the intersection of all the polygons is nonempty.
- KreinâMilman theorem: A convex polygon is the convex hull of its vertices. Thus it is fully defined by the set of its vertices, and one only needs the corners of the polygon to recover the entire polygon shape.
- Hyperplane separation theorem: Any two convex polygons with no points in common have a separator line. If the polygons are closed and at least one of them is compact, then there are even two parallel separator lines (with a gap between them).
- Inscribed triangle property: Of all triangles contained in a convex polygon, there exists a triangle with a maximal area whose vertices are all polygon vertices.JOURNAL
, Chandran, Sharat
, Mount, David M.
, 10.1142/S0218195992000123
, 2
, International Journal of Computational Geometry & Applications
, 1168956
, 191â214
, A parallel algorithm for enclosed and enclosing triangles
, 2
, 1992,
, Mount, David M.
, 10.1142/S0218195992000123
, 2
, International Journal of Computational Geometry & Applications
, 1168956
, 191â214
, A parallel algorithm for enclosed and enclosing triangles
, 2
, 1992,
- Inscribing triangle property: every convex polygon with area A can be inscribed in a triangle of area at most equal to 2A. Equality holds (exclusively) for a parallelogram.WEB, Weisstein, Eric W, Triangle Circumscribing,mathworld.wolfram.com/TriangleCircumscribing.html, Wolfram Math World,
- Inscribed/inscribing rectangles property: For every convex body C in the plane, we can inscribe a rectangle r in C such that a homothetic copy R of r is circumscribed about C and the positive homothety ratio is at most 2 and 0.5 text{ Ã Area}(R) leq text{Area}(C) leq 2 text{ Ã Area}(r).JOURNAL, 10.1007/BF01263495, Approximation of convex bodies by rectangles, Geometriae Dedicata, 47, 111â117, 1993, Lassak, M., 119508642,
- The mean width of a convex polygon is equal to its perimeter divided by pi. So its width is the diameter of a circle with the same perimeter as the polygon.WEB, Jim, Belk, What’s the average width of a convex polygon?,math.stackexchange.com/q/20936, Math Stack Exchange,
Strict convexity
The following properties of a simple polygon are all equivalent to strict convexity:- Every internal angle is strictly less than 180 degrees.
- Every line segment between two points in the interior, or between two points on the boundary but not on the same edge, is strictly interior to the polygon (except at its endpoints if they are on the edges).
- For each edge, the interior points and the boundary points not contained in the edge are on the same side of the line that the edge defines.
- The angle at each vertex contains all other vertices in its interior (except the given vertex and the two adjacent vertices).
See also
- {{Annotated link|Convex curve}}
- {{Annotated link|Concave polygon}}
- {{Annotated link|Convex polytope}}
- {{Annotated link|Cyclic polygon}}
- {{slink|Implicit curve|Smooth approximation of convex polygons}}
- {{Annotated link|Tangential polygon}}
References
External links
{{commons category|Convex polygons}}- {{mathworld |urlname=ConvexPolygon |title=Convex polygon}}
- www.rustycode.com/tutorials/convex.html
- {{citation
| last1 = Schorn
| first1 = Peter
| last2 = Fisher
| first2 = Frederick
| editor-last = Heckbert
| editor-first = Paul S.
| contribution = I.2 Testing the convexity of a polygon
| contribution-url =books.google.com/books?id=CCqzMm_-WucC&pg=PA7
| isbn = 9780123361554
| pages = 7â15
| publisher = Morgan Kaufmann (Academic Press)
| title = Graphics Gems IV
| year = 1994
| url =archive.org/details/isbn_9780123361554/page/7
}}
{{polygons}}| first1 = Peter
| last2 = Fisher
| first2 = Frederick
| editor-last = Heckbert
| editor-first = Paul S.
| contribution = I.2 Testing the convexity of a polygon
| contribution-url =books.google.com/books?id=CCqzMm_-WucC&pg=PA7
| isbn = 9780123361554
| pages = 7â15
| publisher = Morgan Kaufmann (Academic Press)
| title = Graphics Gems IV
| year = 1994
| url =archive.org/details/isbn_9780123361554/page/7
}}
- content above as imported from Wikipedia
- "convex polygon" does not exist on GetWiki (yet)
- time: 7:13am EDT - Wed, May 22 2024
- "convex polygon" does not exist on GetWiki (yet)
- time: 7:13am EDT - Wed, May 22 2024
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 21 MAY 2024
The Illusion of Choice
Culture
Culture
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GetMeta:About
GetWiki
GetWiki
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
Biographies
GETWIKI 20 AUG 2014
GetMeta:News
GetWiki
GetWiki
© 2024 M.R.M. PARROTT | ALL RIGHTS RESERVED