In Euclidean geometry, a cyclic quadrilateral or inscribed quadrilateral is a quadrilateral whose vertices all lie on a single 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. Other names for these quadrilaterals are concyclic quadrilateral and chordal quadrilateral, the latter since the sides of the quadrilateral are chords of the circumcircle. Usually the quadrilateral is assumed to be convex, but there are also 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 characterizations below states what necessary and sufficient conditions a quadrilateral must satisfy to have a circumcircle.
Any square, rectangle, isosceles trapezoid, or antiparallelogram is cyclic. A kite is cyclic if and only if it has two right angles – a right kite. A bicentric quadrilateral is a cyclic quadrilateral that is also tangential and an ex-bicentric quadrilateral is a cyclic quadrilateral that is also ex-tangential. A harmonic quadrilateral is a cyclic quadrilateral in which the product of the lengths of opposite sides are equal.
A convex quadrilateral is cyclic if and only if the four perpendicular bisectors to the sides are concurrent. This common point is the circumcenter.
A convex quadrilateral ABCD is cyclic if and only if its opposite angles are supplementary, that is
The direct theorem was Proposition 22 in Book 3 of Euclid's Elements. Equivalently, a convex quadrilateral is cyclic if and only if each exterior angle is equal to the opposite interior angle.
In 1836 Duncan Gregory generalized this result as follows: Given any convex cyclic 2n-gon, then the two sums of alternate interior angles are each equal to (n-1).
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In Euclidean geometry, Brahmagupta's formula, named after the 7th century Indian mathematician, is used to find the area of any cyclic quadrilateral (one that can be inscribed in a circle) given the lengths of the sides. Its generalized version, Bretschneider's formula, can be used with non-cyclic quadrilateral. Heron's formula can be thought as a special case of the Brahmagupta's formula for triangles.
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 , , and is sometimes denoted as .
In geometry, collinearity of a set of points is the property of their lying on a single line. A set of points with this property is said to be collinear (sometimes spelled as colinear). In greater generality, the term has been used for aligned objects, that is, things being "in a line" or "in a row". In any geometry, the set of points on a line are said to be collinear. In Euclidean geometry this relation is intuitively visualized by points lying in a row on a "straight line".
Ce cours entend exposer les fondements de la géométrie à un triple titre :
1/ de technique mathématique essentielle au processus de conception du projet,
2/ d'objet privilégié des logiciels de concept
Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...
Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...
This paper proposes a method for the construction of quadratic serendipity element (QSE) shape functions on planar convex and concave polygons. Existing approaches for constructing QSE shape functions are linear combinations of the pair-wise products of ge ...