|
Convex Shape
In geometry, a convex polygon is a polygon that is the Boundary (topology), 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 polygon, self-intersecting). Equivalently, a polygon is convex if every line (geometry), 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. Properties The following properties of a simple polygon are all equivalent to convexity: *Every internal angle is strictly less than 180 Degree (angle), degrees. *Every point on every line segment between two points inside or on the boundary of the pol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pentagon
In geometry, a pentagon (from the Greek πέντε ''pente'' meaning ''five'' and γωνία ''gonia'' meaning ''angle'') is any five-sided polygon or 5-gon. The sum of the internal angles in a simple pentagon is 540°. A pentagon may be simple or self-intersecting. A self-intersecting ''regular pentagon'' (or ''star pentagon'') is called a pentagram. Regular pentagons A '' regular pentagon'' has Schläfli symbol and interior angles of 108°. A '' regular pentagon'' has five lines of reflectional symmetry, and rotational symmetry of order 5 (through 72°, 144°, 216° and 288°). The diagonals of a convex regular pentagon are in the golden ratio to its sides. Given its side length t, its height H (distance from one side to the opposite vertex), width W (distance between two farthest separated points, which equals the diagonal length D) and circumradius R are given by: :\begin H &= \frac~t \approx 1.539~t, \\ W= D &= \frac~t\approx 1.618~t, \\ W &= \sqr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Helly's Theorem
Helly's theorem is a basic result in discrete geometry on the intersection of convex sets. It was discovered by Eduard Helly in 1913,. but not published by him until 1923, by which time alternative proofs by and had already appeared. Helly's theorem gave rise to the notion of a Helly family. Statement Let be a finite collection of convex subsets of , with . If the intersection of every of these sets is nonempty, then the whole collection has a nonempty intersection; that is, :\bigcap_^n X_j\ne\varnothing. For infinite collections one has to assume compactness: Let be a collection of compact convex subsets of , such that every subcollection of cardinality at most has nonempty intersection. Then the whole collection has nonempty intersection. Proof We prove the finite version, using Radon's theorem as in the proof by . The infinite version then follows by the finite intersection property characterization of compactness: a collection of closed subsets of a compact spac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Morgan Kaufmann
Morgan Kaufmann Publishers is a Burlington, Massachusetts (San Francisco, California until 2008) based publisher specializing in computer science and engineering content. Since 1984, Morgan Kaufmann has published content on information technology, computer architecture, data management, computer networking, computer systems, human computer interaction, computer graphics, multimedia information and systems, artificial intelligence, computer security, and software engineering. Morgan Kaufmann's audience includes the research and development communities, information technology (IS/IT) managers, and students in professional degree programs. The company was founded in 1984 by publishers Michael B. Morgan and William Kaufmann and computer scientist Nils Nilsson. It was held privately until 1998, when it was acquired by Harcourt General and became an imprint of the Academic Press, a subsidiary of Harcourt. Harcourt was acquired by Reed Elsevier in 2001; Morgan Kaufmann is now an imprint ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tangential Polygon
In Euclidean geometry, a tangential polygon, also known as a circumscribed polygon, is a convex polygon that contains an inscribed circle (also called an ''incircle''). This is a circle that is tangent to each of the polygon's sides. The dual polygon of a tangential polygon is a cyclic polygon, which has a circumscribed circle passing through each of its vertices. All triangles are tangential, as are all regular polygons with any number of sides. A well-studied group of tangential polygons are the tangential quadrilaterals, which include the rhombi and kites. Characterizations A convex polygon has an incircle if and only if all of its internal angle bisectors are concurrent. This common point is the ''incenter'' (the center of the incircle). There exists a tangential polygon of ''n'' sequential sides ''a''1, ..., ''a''''n'' if and only if the system of equations :x_1+x_2=a_1,\quad x_2+x_3=a_2,\quad \ldots,\quad x_n+x_1=a_n has a solution (''x''1, ..., ''x''''n'') in positive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Polygon
In geometry, the circumscribed circle or circumcircle of a polygon is a circle that passes through all the vertices of the polygon. The center of this circle is called the circumcenter and its radius is called the circumradius. Not every polygon has a circumscribed circle. A polygon that does have one is called a cyclic polygon, or sometimes a concyclic polygon because its vertices are concyclic. All triangles, all regular simple polygons, all rectangles, all isosceles trapezoids, and all right kites are cyclic. A related notion is the one of a minimum bounding circle, which is the smallest circle that completely contains the polygon within it, if the circle's center is within the polygon. Every polygon has a unique minimum bounding circle, which may be constructed by a linear time algorithm. Even if a polygon has a circumscribed circle, it may be different from its minimum bounding circle. For example, for an obtuse triangle, the minimum bounding circle has the longest side ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Concave Polygon
A simple polygon that is not convex is called concave, non-convex or reentrant. A concave polygon will always have at least one reflex interior angle—that is, an angle with a measure that is between 180 degrees and 360 degrees exclusive. Polygon Some lines containing interior points of a concave polygon intersect its boundary at more than two points. Some diagonals of a concave polygon lie partly or wholly outside the polygon. Some sidelines of a concave polygon fail to divide the plane into two half-planes one of which entirely contains the polygon. None of these three statements holds for a convex polygon. As with any simple polygon, the sum of the internal angles of a concave polygon is ×(''n'' − 2) radians, equivalently 180×(''n'' − 2) degrees (°), where ''n'' is the number of sides. 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 polyg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Curve
In geometry, a convex curve is a plane curve that has a supporting line through each of its points. There are many other equivalent definitions of these curves, going back to Archimedes. Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions. Important subclasses of convex curves include the closed convex curves (the boundaries of bounded convex sets), the smooth curves that are convex, and the strictly convex curves, which have the additional property that each supporting line passes through a unique point of the curve. Combinations of these properties have also been considered. Bounded convex curves have a well-defined length, which can be obtained by approximating them with polygons, or from the average length of their projections onto a line. The maximum number of grid points that can belong to a single curve is controlled by its length. The points at which a convex curve has a unique supporting line are dens ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangle
A triangle is a polygon with three Edge (geometry), edges and three Vertex (geometry), vertices. It is one of the basic shapes in geometry. A triangle with vertices ''A'', ''B'', and ''C'' is denoted \triangle ABC. In Euclidean geometry, any three points, when non-Collinearity, collinear, determine a unique triangle and simultaneously, a unique Plane (mathematics), plane (i.e. a two-dimensional Euclidean space). In other words, there is only one plane that contains that triangle, and every triangle is contained in some plane. If the entire geometry is only the Euclidean plane, there is only one plane and all triangles are contained in it; however, in higher-dimensional Euclidean spaces, this is no longer true. This article is about triangles in Euclidean geometry, and in particular, the Euclidean plane, except where otherwise noted. Types of triangle The terminology for categorizing triangles is more than two thousand years old, having been defined on the very first page of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Self-intersecting Polygons
Self-intersecting polygons, crossed polygons, or self-crossing polygons are polygons some of whose edges cross each other. They contrast with simple polygons, whose edges never cross. Some types of self-intersecting polygons are: *the crossed quadrilateral, with four edges **the antiparallelogram, a crossed quadrilateral with alternate edges of equal length ***the crossed rectangle, an antiparallelogram whose edges are two opposite sides and the two diagonals of a rectangle, hence having two edges parallel *Star polygons **pentagram, with five edges **heptagram, with seven edges **octagram, with eight edges ** enneagram or nonagram, with nine edges ** decagram, with ten edges **hendecagram, with eleven edges **dodecagram, with twelve edges See also * List of regular polytopes and compounds#Stars *Complex polygon The term ''complex polygon'' can mean two different things: * In geometry, a polygon in the unitary plane, which has two complex dimensions. * In computer graphics, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mean Width
In geometry, the mean width is a measure of the "size" of a body; see Hadwiger's theorem for more about the available measures of bodies. In n dimensions, one has to consider (n-1)-dimensional hyperplanes perpendicular to a given direction \hat in S^, where S^n is the n-sphere (the surface of a (n+1)-dimensional sphere). The "width" of a body in a given direction \hat is the distance between the closest pair of such planes, such that the body is entirely in between the two hyper planes (the planes only intersect with the boundary of the body). The mean width is the average of this "width" over all \hat in S^. More formally, define a compact body B as being equivalent to set of points in its interior plus the points on the boundary (here, points denote elements of \mathbb^n). The support function of body B is defined as : h_B(n)=\max\ where n is a direction and \langle,\rangle denotes the usual inner product on \mathbb^n. The mean width is then : b(B)=\frac \int_ h_B(\hat)+h_B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homothetic Transformation
In mathematics, a homothety (or homothecy, or homogeneous dilation) is a transformation of an affine space determined by a point ''S'' called its ''center'' and a nonzero number ''k'' called its ''ratio'', which sends point X to a point X' by the rule : \overrightarrow=k\overrightarrow for a fixed number k\ne 0. Using position vectors: :\mathbf x'=\mathbf s + k(\mathbf x -\mathbf s). In case of S=O (Origin): :\mathbf x'=k\mathbf x, which is a uniform scaling and shows the meaning of special choices for k: :for k=1 one gets the ''identity'' mapping, :for k=-1 one gets the ''reflection'' at the center, For 1/k one gets the ''inverse'' mapping defined by k. In Euclidean geometry homotheties are the similarities that fix a point and either preserve (if k>0) or reverse (if k<0) the direction of all vectors. Together with the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
