|
Circumscribed Circle
In geometry, a circumscribed circle for a set of points is a circle passing through each of them. Such a circle is said to ''circumscribe'' the points or a polygon formed from them; such a polygon is said to be ''inscribed'' in the circle. * Circumcircle, the circumscribed circle of a triangle, which always exists for a given triangle. * Cyclic polygon, a general polygon that can be circumscribed by a circle. The vertices of this polygon are concyclic points. All triangles are cyclic polygons. * Cyclic quadrilateral, a special case of a cyclic polygon. See also * Smallest-circle problem, the related problem of finding the circle with minimal radius containing an arbitrary set of points, not necessarily passing through them. * Inscribed figure {{sia ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circumcircle
In geometry, the circumscribed circle or circumcircle of a triangle is a circle that passes through all three vertex (geometry), vertices. The center of this circle is called the circumcenter of the triangle, and its radius is called the circumradius. The circumcenter is the point of intersection (geometry), intersection between the three perpendicular bisectors of the triangle's sides, and is a triangle center. More generally, an -sided polygon with all its vertices on the same circle, also called the circumscribed circle, is called a cyclic polygon, or in the special case , a cyclic quadrilateral. All rectangles, isosceles trapezoids, right kites, and regular polygons are cyclic, but not every polygon is. Straightedge and compass construction The circumcenter of a triangle can be Compass-and-straightedge construction, constructed by drawing any two of the three Bisection#Perpendicular bisectors, perpendicular bisectors. For three non-collinear points, these two lines cannot be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Polygon
In geometry, a set (mathematics), set of point (geometry), points are said to be concyclic (or cocyclic) if they lie on a common circle. A polygon whose vertex (geometry), vertices are concyclic is called a cyclic polygon, and the circle is called its ''circumscribing circle'' or ''circumcircle''. All concyclic points are equidistant from the center of the circle. Three points in the Euclidean plane, plane that do not all fall on a straight line are concyclic, so every triangle is a cyclic polygon, with a well-defined circumcircle. However, four or more points in the plane are not necessarily concyclic. After triangles, the special case of cyclic quadrilaterals has been most extensively studied. Perpendicular 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 triangula ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Concyclic Points
In geometry, a set of points are said to be concyclic (or cocyclic) if they lie on a common circle. A polygon whose vertices are concyclic is called a cyclic polygon, and the circle is called its ''circumscribing circle'' or ''circumcircle''. All concyclic points are equidistant from the center of the circle. Three points in the plane that do not all fall on a straight line are concyclic, so every triangle is a cyclic polygon, with a well-defined circumcircle. However, four or more points in the plane are not necessarily concyclic. After triangles, the special case of cyclic quadrilaterals has been most extensively studied. Perpendicular 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Quadrilateral
In geometry, a cyclic quadrilateral or inscribed quadrilateral is a quadrilateral (four-sided polygon) whose vertex (geometry), vertices all lie on a single circle, making the sides Chord (geometry), chords of the circle. This circle is called the ''circumcircle'' or ''circumscribed circle'', and the vertices are said to be ''concyclic''. The center of the circle and its radius are called the ''circumcenter'' and the ''circumradius'' respectively. Usually the quadrilateral is assumed to be convex polygon, convex, but there are also Crossed quadrilateral, crossed cyclic quadrilaterals. The formulas and properties given below are valid in the convex case. The word cyclic is from the Ancient Greek (''kuklos''), which means "circle" or "wheel". All triangles have a circumcircle, but not all quadrilaterals do. An example of a quadrilateral that cannot be cyclic is a non-square rhombus. The section Cyclic quadrilateral#Characterizations, characterizations below states what necessar ... [...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 computational geometry 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 hig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
