|
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 pol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simple Polygon
In geometry, a simple polygon is a polygon that does not Intersection (Euclidean geometry), intersect itself and has no holes. That is, it is a Piecewise linear curve, piecewise-linear Jordan curve consisting of finitely many line segments. These polygons include as special cases the convex polygons, star-shaped polygons, and monotone polygons. The sum of external angles of a simple polygon is 2\pi. Every simple polygon with n sides can be polygon triangulation, triangulated by n-3 of its diagonals, and by the art gallery theorem its interior is visible from some \lfloor n/3\rfloor of its vertices. Simple polygons are commonly seen as the input to computational geometry problems, including point in polygon testing, area computation, the convex hull of a simple polygon, triangulation, and Euclidean shortest paths. Other constructions in geometry related to simple polygons include Schwarz–Christoffel mapping, used to find conformal maps involving simple polygons, polygonalizat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polygon
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). Equivalently, a polygon is convex if every line that does not contain any edge intersects the polygon in at most two points. Strictly convex polygon A convex polygon is ''strictly'' convex if no line contains more than two vertices of the polygon. 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 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 bou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reflex Angle
In Euclidean geometry, an angle can refer to a number of concepts relating to the intersection of two straight lines at a point. Formally, an angle is a figure lying in a plane formed by two rays, called the '' sides'' of the angle, sharing a common endpoint, called the '' vertex'' of the angle. More generally angles are also formed wherever two lines, rays or line segments come together, such as at the corners of triangles and other polygons. An angle can be considered as the region of the plane bounded by the sides. Angles can also be formed by the intersection of two planes or by two intersecting curves, in which case the rays lying tangent to each curve at the point of intersection define the angle. The term ''angle'' is also used for the size, magnitude or quantity of these types of geometric figures and in this context an angle consists of a number and unit of measurement. Angular measure or measure of angle are sometimes used to distinguish between the measurement and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diagonal
In geometry, a diagonal is a line segment joining two vertices of a polygon or polyhedron, when those vertices are not on the same edge. Informally, any sloping line is called diagonal. The word ''diagonal'' derives from the ancient Greek διαγώνιος ''diagonios'', "from corner to corner" (from διά- ''dia-'', "through", "across" and γωνία ''gonia'', "corner", related to ''gony'' "knee"); it was used by both Strabo and Euclid to refer to a line connecting two vertices of a rhombus or cuboid, and later adopted into Latin as ''diagonus'' ("slanting line"). Polygons As applied to a polygon, a diagonal is a line segment joining any two non-consecutive vertices. Therefore, a quadrilateral has two diagonals, joining opposite pairs of vertices. For any convex polygon, all the diagonals are inside the polygon, but for re-entrant polygons, some diagonals are outside of the polygon. Any ''n''-sided polygon (''n'' ≥ 3), convex or concave, has \tfrac ''total'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Extended Side
In plane geometry, an extended side or sideline of a polygon is the line that contains one side of the polygon. The extension of a finite side (a line segment) into an infinite line arises in various contexts. Triangle In an obtuse triangle, the altitudes from the acute angled vertices intersect the corresponding ''extended base'' sides but not the base sides themselves. The excircles of a triangle, as well as the triangle's inconics that are not inellipses, are externally tangent to one side and to the other two extended sides. Trilinear coordinates locate a point in the plane by its relative distances from the extended sides of a reference triangle. If the point is outside the triangle, the perpendicular from the point to the sideline may meet the sideline outside the triangle—that is, not on the actual side of the triangle. In a triangle, three intersection points, each of an external angle bisector with the opposite extended side, are collinear.Johnson, Roger ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Internal Angle
In geometry, an angle of a polygon is formed by two adjacent edge (geometry), sides. For a simple polygon (non-self-intersecting), regardless of whether it is Polygon#Convexity and non-convexity, convex or non-convex, this angle is called an internal angle (or interior angle) if a point within the angle is in the interior of the polygon. A polygon has exactly one internal angle per vertex (geometry), vertex. If every internal angle of a simple polygon is less than a straight angle (pi, radians or 180°), then the polygon is called convex polygon, convex. In contrast, an external angle (also called a turning angle or exterior angle) is an angle formed by one side of a simple polygon and a Extended side, line extended from an adjacent side.Posamentier, Alfred S., and Lehmann, Ingmar. ''The Secrets of Triangles'', Prometheus Books, 2012. Properties * The sum of the internal angle and the external angle on the same vertex is radians (180°). * The sum of all the internal angl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Radian
The radian, denoted by the symbol rad, is the unit of angle in the International System of Units (SI) and is the standard unit of angular measure used in many areas of mathematics. It is defined such that one radian is the angle subtended at the centre of a circle by an Circular arc, arc that is equal in length to the radius. The unit was formerly an SI supplementary unit and is currently a dimensionless unit, dimensionless SI derived unit,: "The CGPM decided to interpret the supplementary units in the SI, namely the radian and the steradian, as dimensionless derived units." defined in the SI as 1 rad = 1 and expressed in terms of the SI base unit metre (m) as . Angles without explicitly specified units are generally assumed to be measured in radians, especially in mathematical writing. Definition One radian is defined as the angle at the center of a circle in a plane that wikt:subtend, subtends an arc whose length equals the radius of the circle. More generally, the magnit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partition Of A Set
In mathematics, a partition of a set is a grouping of its elements into Empty set, non-empty subsets, in such a way that every element is included in exactly one subset. Every equivalence relation on a Set (mathematics), set defines a partition of this set, and every partition defines an equivalence relation. A set equipped with an equivalence relation or a partition is sometimes called a setoid, typically in type theory and proof theory. Definition and notation A partition of a set ''X'' is a set of non-empty subsets of ''X'' such that every element ''x'' in ''X'' is in exactly one of these subsets (i.e., the subsets are nonempty mutually disjoint sets). Equivalently, a family of sets ''P'' is a partition of ''X'' if and only if all of the following conditions hold: *The family ''P'' does not contain the empty set (that is \emptyset \notin P). *The union (set theory), union of the sets in ''P'' is equal to ''X'' (that is \textstyle\bigcup_ A = X). The sets in ''P'' are said ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial-time
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is gener ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangle
A triangle is a polygon with three corners and three sides, one of the basic shapes in geometry. The corners, also called ''vertices'', are zero-dimensional points while the sides connecting them, also called ''edges'', are one-dimensional line segments. A triangle has three internal angles, each one bounded by a pair of adjacent edges; the sum of angles of a triangle always equals a straight angle (180 degrees or π radians). The triangle is a plane figure and its interior is a planar region. Sometimes an arbitrary edge is chosen to be the ''base'', in which case the opposite vertex is called the ''apex''; the shortest segment between the base and apex is the ''height''. The area of a triangle equals one-half the product of height and base length. In Euclidean geometry, any two points determine a unique line segment situated within a unique straight line, and any three points that do not all lie on the same straight line determine a unique triangle situated w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadrilateral
In Euclidean geometry, geometry a quadrilateral is a four-sided polygon, having four Edge (geometry), edges (sides) and four Vertex (geometry), corners (vertices). The word is derived from the Latin words ''quadri'', a variant of four, and ''latus'', meaning "side". It is also called a tetragon, derived from Greek "tetra" meaning "four" and "gon" meaning "corner" or "angle", in analogy to other polygons (e.g. pentagon). Since "gon" means "angle", it is analogously called a quadrangle, or 4-angle. A quadrilateral with vertices A, B, C and D is sometimes denoted as \square ABCD. Quadrilaterals are either simple polygon, simple (not self-intersecting), or complex polygon, complex (self-intersecting, or crossed). Simple quadrilaterals are either convex polygon, convex or concave polygon, concave. The Internal and external angle, interior angles of a simple (and Plane (geometry), planar) quadrilateral ''ABCD'' add up to 360 Degree (angle), degrees, that is :\angle A+\angle B+\angle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
