|
Circumscribed
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 sid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circumscribed Polygon
In geometry, the circumscribed circle or circumcircle of a polygon is a circle that passes through all the vertex (geometry), 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 polygon, regular simple polygons, all rectangles, all isosceles trapezoids, and all right kites are cyclic. A related notion is the one of a Smallest circle problem, 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 t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circumcenter Construction
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] |
Concyclic
In geometry, a set of points are said to be concyclic (or cocyclic) if they lie on a common circle. All concyclic points are at the same distance from the center of the circle. Three points in the plane that do not all fall on a straight line are concyclic, but four or more such points in the plane are not necessarily concyclic. Bisectors In general the centre ''O'' of a circle on which points ''P'' and ''Q'' lie must be such that ''OP'' and ''OQ'' are equal distances. Therefore ''O'' must lie on the perpendicular bisector of the line segment ''PQ''. For ''n'' distinct points there are ''n''(''n'' − 1)/2 bisectors, and the concyclic condition is that they all meet in a single point, the centre ''O''. Cyclic polygons Triangles The vertices of every triangle fall on a circle. (Because of this, some authors define "concyclic" only in the context of four or more points on a circle.) The circle containing the vertices of a triangle is called the circumscribed circle o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circumsphere
In geometry, a circumscribed sphere of a polyhedron is a sphere that contains the polyhedron and touches each of the polyhedron's vertices. The word circumsphere is sometimes used to mean the same thing, by analogy with the term ''circumcircle''. As in the case of two-dimensional circumscribed circles (circumcircles), the radius of a sphere circumscribed around a polyhedron is called the circumradius of , and the center point of this sphere is called the circumcenter of . Existence and optimality When it exists, a circumscribed sphere need not be the smallest sphere containing the polyhedron; for instance, the tetrahedron formed by a vertex of a cube and its three neighbors has the same circumsphere as the cube itself, but can be contained within a smaller sphere having the three neighboring vertices on its equator. However, the smallest sphere containing a given polyhedron is always the circumsphere of the convex hull of a subset of the vertices of the polyhedron.. In ''De ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polygon
In Euclidean geometry, a regular polygon is a polygon that is Equiangular polygon, direct equiangular (all angles are equal in measure) and Equilateral polygon, equilateral (all sides have the same length). Regular polygons may be either convex polygon, convex, star polygon, star or Skew polygon, skew. In the limit (mathematics), limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a Line (geometry), straight line), if the edge length is fixed. General properties ''These properties apply to all regular polygons, whether convex or star polygon, star.'' A regular ''n''-sided polygon has rotational symmetry of order ''n''. All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon. Together with the property of equal-length sides, this implies that every regular p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Right Kite
In Euclidean geometry, a right kite is a kite (a quadrilateral whose four sides can be grouped into two pairs of equal-length sides that are adjacent to each other) that can be inscribed in a circle.Michael de Villiers, ''Some Adventures in Euclidean Geometry'', , 2009, pp. 154, 206. That is, it is a kite with a circumcircle (i.e., a cyclic kite). Thus the right kite is a convex quadrilateral and has two opposite right angles. If there are exactly two right angles, each must be between sides of different lengths. All right kites are bicentric quadrilaterals (quadrilaterals with both a circumcircle and an incircle), since all kites have an incircle. One of the diagonals (the one that is a line of symmetry) divides the right kite into two right triangles and is also a diameter of the circumcircle. In a tangential quadrilateral (one with an incircle), the four line segments between the center of the incircle and the points where it is tangent to the quadrilateral partition the quadr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Smallest Circle Problem
The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing circle problem) is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane. The corresponding problem in ''n''-dimensional space, the smallest bounding sphere problem, is to compute the smallest ''n''-sphere that contains all of a given set of points. The smallest-circle problem was initially proposed by the English mathematician James Joseph Sylvester in 1857. The smallest-circle problem in the plane is an example of a facility location problem (the 1-center problem) in which the location of a new facility must be chosen to provide service to a number of customers, minimizing the farthest distance that any customer must travel to reach the new facility. Both the smallest circle problem in the plane, and the smallest bounding sphere problem in any higher-dimensiona ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (geometry)
In geometry, a vertex (in plural form: vertices or vertexes) is a point (geometry), point where two or more curves, line (geometry), lines, or edge (geometry), edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedron, polyhedra are vertices. Definition Of an angle The ''vertex'' of an angle is the point where two Line (mathematics)#Ray, rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place. :(3 vols.): (vol. 1), (vol. 2), (vol. 3). Of a polytope A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection (Euclidean geometry), intersection of Edge (geometry), edges, face (geometry), faces or facets of the object. In a polygon, a vertex is called "convex set, convex" if the internal an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Position Line
A position line or line of position (LOP) is a line (or, on the surface of the earth, a curve) that can be both identified on a chart (nautical chart or aeronautical chart) and translated to the surface of the earth. The intersection of a minimum of two position lines is a fix that is used in position fixing to identify a navigator's location. There are several types of position line: * Compass bearing – the angle between north and the line passing through the compass and the point of interest * Transit – a line passing through the observer and two other reference points * Leading line – the line passing through two marks indicating a safe channel * Leading lights – the line passing through two beacons indicating a safe channel * Sector lights – the lines created by masked colored lights that indicate a safe channel See also * Coordinate line * Intersection (aeronautics) * Navigation * Position circle * Sight reduction In astronavigation, sight reduction is the proce ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cofactor Expansion
In linear algebra, the Laplace expansion, named after Pierre-Simon Laplace, also called cofactor expansion, is an expression of the determinant of an matrix as a weighted sum of minors, which are the determinants of some submatrices of . Specifically, for every , \begin \det(B)&= \sum_^ (-1)^ B_ M_, \end where B_ is the entry of the th row and th column of , and M_ is the determinant of the submatrix obtained by removing the th row and the th column of . The term (-1)^ M_ is called the cofactor of B_ in . The Laplace expansion is often useful in proofs, as in, for example, allowing recursion on the size of matrices. It is also of didactic interest for its simplicity, and as one of several ways to view and compute the determinant. For large matrices, it quickly becomes inefficient to compute, when compared to Gaussian elimination. Examples Consider the matrix : B = \begin 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end. The determinant of this matrix can be computed by using ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Determinant
In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one). The determinant of a matrix is denoted , , or . The determinant of a matrix is :\begin a & b\\c & d \end=ad-bc, and the determinant of a matrix is : \begin a & b & c \\ d & e & f \\ g & h & i \end= aei + bfg + cdh - ceg - bdi - afh. The determinant of a matrix can be defined in several equivalent ways. Leibniz formula expresses the determinant as a sum of signed products of matrix entries such that each summand is the product of different entries, and the number of these summands is n!, the factorial of (t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Locus (mathematics)
In geometry, a locus (plural: ''loci'') (Latin word for "place", "location") is a set of all points (commonly, a line, a line segment, a curve or a surface), whose location satisfies or is determined by one or more specified conditions.. In other words, the set of the points that satisfy some property is often called the ''locus of a point'' satisfying this property. The use of the singular in this formulation is a witness that, until the end of the 19th century, mathematicians did not consider infinite sets. Instead of viewing lines and curves as sets of points, they viewed them as places where a point may be ''located'' or may move. History and philosophy Until the beginning of the 20th century, a geometrical shape (for example a curve) was not considered as an infinite set of points; rather, it was considered as an entity on which a point may be located or on which it moves. Thus a circle in the Euclidean plane was defined as the ''locus'' of a point that is at a given dist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
