|
Re-entrant 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simple Polygon
In geometry, a simple polygon is a polygon that does not intersect itself and has no holes. That is, it is a flat shape consisting of straight, non-intersecting line segments or "sides" that are joined pairwise to form a single closed path. If the sides intersect then the polygon is not simple. The qualifier "simple" is frequently omitted, with the above definition then being understood to define a polygon in general. The definition given above ensures the following properties: * A polygon encloses a region (called its interior) which always has a measurable area. * The line segments that make up a polygon (called sides or edges) meet only at their endpoints, called vertices (singular: vertex) or less formally "corners". * Exactly two edges meet at each vertex. * The number of edges always equals the number of vertices. Two edges meeting at a corner are usually required to form an angle that is not straight (180°); otherwise, the collinear line segments will be considered part ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simple Polygon
In geometry, a simple polygon is a polygon that does not intersect itself and has no holes. That is, it is a flat shape consisting of straight, non-intersecting line segments or "sides" that are joined pairwise to form a single closed path. If the sides intersect then the polygon is not simple. The qualifier "simple" is frequently omitted, with the above definition then being understood to define a polygon in general. The definition given above ensures the following properties: * A polygon encloses a region (called its interior) which always has a measurable area. * The line segments that make up a polygon (called sides or edges) meet only at their endpoints, called vertices (singular: vertex) or less formally "corners". * Exactly two edges meet at each vertex. * The number of edges always equals the number of vertices. Two edges meeting at a corner are usually required to form an angle that is not straight (180°); otherwise, the collinear line segments will be considered part ... [...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. 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 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reflex Angle
In Euclidean geometry, an angle is the figure formed by two rays, called the '' sides'' of the angle, sharing a common endpoint, called the ''vertex'' of the angle. Angles formed by two rays lie in the plane that contains the rays. Angles are also formed by the intersection of two planes. These are called dihedral angles. Two intersecting curves may also define an angle, which is the angle of the rays lying tangent to the respective curves at their point of intersection. ''Angle'' is also used to designate the measure of an angle or of a rotation. This measure is the ratio of the length of a circular arc to its radius. In the case of a geometric angle, the arc is centered at the vertex and delimited by the sides. In the case of a rotation, the arc is centered at the center of the rotation and delimited by any other point and its image by the rotation. History and etymology The word ''angle'' comes from the Latin word ''angulus'', meaning "corner"; cognate words are the Gr ... [...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 angle to angle" (from διά- ''dia-'', "through", "across" and γωνία ''gonia'', "angle", 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"). In matrix algebra, the diagonal of a square matrix consists of the entries on the line from the top left corner to the bottom right corner. There are also other, non-mathematical uses. Non-mathematical uses In engineering, a diagonal brace is a beam used to brace a rectangular structure (such as scaffolding) to withstand strong forces pushing into it; although called a diagonal, due to practical considerations ... [...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 side 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 A., ''Advanced Euclidean Geometry'', Dover Publ. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Internal Angle
In geometry, an angle of a polygon is formed by two sides of the polygon that share an endpoint. For a simple (non-self-intersecting) polygon, regardless of whether it is convex or non-convex, this angle is called an interior angle (or ) if a point within the angle is in the interior of the polygon. A polygon has exactly one internal angle per vertex. If every internal angle of a simple polygon is less than π radians (180°), then the polygon is called convex. In contrast, an exterior angle (also called an or turning angle) is an angle formed by one side of a simple polygon and a line extended from an adjacent side.Weisstein, Eric W. "Exterior Angle Bisector." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/ExteriorAngleBisector.htmlPosamentier, 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 ... [...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. The unit was formerly an SI supplementary unit (before that category was abolished in 1995). The radian is defined in the SI as being a dimensionless unit, with 1 rad = 1. Its symbol is accordingly often omitted, especially in mathematical writing. Definition One radian is defined as the angle subtended from the center of a circle which intercepts an arc equal in length to the radius of the circle. More generally, the magnitude in radians of a subtended angle is equal to the ratio of the arc length to the radius of the circle; that is, \theta = \frac, where is the subtended angle in radians, is arc length, and is radius. A right angle is exactly \frac radians. The rotation angle (360°) corresponding to one complete revolution is the length of the circumference divided by the radius, wh ... [...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 non-empty subsets, in such a way that every element is included in exactly one subset. Every equivalence relation on a 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., ''X'' is a disjoint union of the subsets). 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 of the sets in ''P'' is equal to ''X'' (that is \textstyle\bigcup_ A = X). The sets in ''P'' are said to exhaust or cover ''X''. See also collectively ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial-time
In 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 generally expresse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangle
A triangle is a polygon with three edges and three 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- collinear, determine a unique triangle and simultaneously, a unique 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 Euclid's Elements. The names used for modern classification are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadrilateral
In geometry a quadrilateral is a four-sided polygon, having four edges (sides) and four 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 (not self-intersecting), or complex (self-intersecting, or crossed). Simple quadrilaterals are either convex or concave. The interior angles of a simple (and planar) quadrilateral ''ABCD'' add up to 360 degrees of arc, that is :\angle A+\angle B+\angle C+\angle D=360^. This is a special case of the ''n''-gon interior angle sum formula: ''S'' = (''n'' − 2) × 180°. All non-self-crossing quadrilaterals tile the plan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
