http___en.wikipedia.org_wiki_Convex_polygon_1.xml
1.1 2.1 2.2 3.1 4.1 5.1 6.1 7.1
Изпъкнал многоъгълник Изпъкналият многоъгълник е многоъгълник, чиято вътрешност е изпъкнало множество.[1] При него всички вътрешни ъгли са под ъгъл по-малък от 180°. Също така, всяка отсечка между два върха остава вътре или на границата на полигона. Следствия: - Един прост многоъгълник е строго изпъкнал, ако всеки негов вътрешен ъгъл е строго по-малък от 180 градуса. - Всеки триъгълник е строго изпъкнал. Изпъкнал четириъгълник[редактиране | edit source] Частен случай на изпъкналия многоъгълник е изпъкналия четириъгълник.
1.1 2.1 3.1 4.1 5.1 6.1 7.1 8.1 9.1 10.1 11.1 12.1 13.1 14.1 15.1 16.1 16.2 16.3 17.1 17.2 18.1 19.1 19.2 20.1 20.2 21.1 21.2 22.1 23.1 23.2 24.1 25.1 26.1 27.1 27.2 28.1 29.1 30.1 31.1 31.2 31.3 32.1 32.2 33.1 33.2 33.3 34.1 35.1 36.1 37.1 38.1
Convex and concave polygons In geometry, a polygon can be either convex or concave (synonyms for the latter being non-convex and reentrant). Contents Convex polygons[edit] A convex polygon is a simple polygon whose interior is a convex set.[1] In a convex polygon, all interior angles are less than 180 degrees. Properties of convex polygons[edit] The following properties of a simple polygon are all equivalent to convexity: - Every internal angle is less than or equal to 180 degrees. - Every line segment between two vertices remains inside or on the boundary of the polygon. - The polygon is entirely contained in a closed half-plane defined by each of its edges. - For each edge, the vertices 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 three vertices defining the angle). Additional properties of convex polygons: - The intersection of two convex polygons is a convex polygon. - Helly's theorem: For every collection of at least 3 convex polygons: if the intersection of every 3 of them is nonempty, then the whole collection has a nonempty intersection. - Krein–Milman theorem: A convex polygon is the convex hull of its vertices. I.e.: it is fully defined by the set of its vertices. I.e.: one only needs the corners of the polygon to recover the entire polygon shape. - Hyperplane separation theorem: Any two convex polygons 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.[2] - 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.[3] - 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.[4] Every polygon inscribed in a circle (such that all vertices of the polygon touch the circle), if not self-intersecting, is convex. However, not every convex polygon can be inscribed in a circle. Strict convexity[edit] A simple polygon is strictly convex if every internal angle is strictly less than 180 degrees. Equivalently, a polygon is strictly convex if every line segment between two nonadjacent vertices of the polygon is strictly interior to the polygon except at its endpoints. Every nondegenerate triangle is strictly convex. Concave or non-convex polygons[edit] A simple (non-self-intersecting) polygon that is not convex is called concave,[5] non-convex[6] or reentrant.[7] A simple concave polygon will always have an interior angle with a measure that is greater than 180 degrees.[8] It is always possible to partition a concave polygon into a set of convex polygons. A polynomial-time algorithm for finding a decomposition into as few convex polygons as possible is described by Chazelle & Dobkin (1985).[9] See also[edit] References[edit] - ^ Definition and properties of convex polygons with interactive animation. - ^ -, Christos. "Is the area of intersection of convex polygons always convex?". Math Stack Exchange. - ^ Weisstein, Eric W. "Triangle Circumscribing". Wolfram Math World. - ^ Jim Belk. "What's the average width of a convex polygon?". Math Stack Exchange. - ^ McConnell, Jeffrey J. (2006), Computer Graphics: Theory Into Practice, p. 130, ISBN 0-7637-2250-2. - ^ Leff, Lawrence (2008), Let's Review: Geometry, Hauppauge, NY: Barron's Educational Series, p. 66, ISBN 978-0-7641-4069-3 - ^ Mason, J.I. (1946), On the angles of a polygon, The Mathematical Gazette (The Mathematical Association) 30 (291): 237–238, JSTOR 3611229. - ^ Definition and properties of concave polygons with interactive animation. - ^ Chazelle, Bernard; Dobkin, David P. (1985), "Optimal convex decompositions", in Toussaint, G.T., Computational Geometry, Elsevier, pp. 63–133.