|
Lemoine Hexagon
In geometry, the Lemoine hexagon is a cyclic hexagon with vertices given by the six intersections of the edges of a triangle and the three lines that are parallel to the edges that pass through its symmedian point. There are two definitions of the hexagon that differ based on the order in which the vertices are connected. Area and perimeter The Lemoine hexagon can be drawn defined in two ways, first as a simple hexagon with vertices at the intersections as defined before. The second is a self-intersecting hexagon with the lines going through the symmedian point as three of the edges and the other three edges join pairs of adjacent vertices. For the simple hexagon drawn in a triangle with side lengths a, b, c and area \Delta the perimeter is given by : p = \frac and the area by : K = \frac \Delta For the self intersecting hexagon the perimeter is given by : p = \frac and the area by : K = \frac\Delta Circumcircle In geometry, five points determine a conic, so arbitrar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lemoine Hexagon
In geometry, the Lemoine hexagon is a cyclic hexagon with vertices given by the six intersections of the edges of a triangle and the three lines that are parallel to the edges that pass through its symmedian point. There are two definitions of the hexagon that differ based on the order in which the vertices are connected. Area and perimeter The Lemoine hexagon can be drawn defined in two ways, first as a simple hexagon with vertices at the intersections as defined before. The second is a self-intersecting hexagon with the lines going through the symmedian point as three of the edges and the other three edges join pairs of adjacent vertices. For the simple hexagon drawn in a triangle with side lengths a, b, c and area \Delta the perimeter is given by : p = \frac and the area by : K = \frac \Delta For the self intersecting hexagon the perimeter is given by : p = \frac and the area by : K = \frac\Delta Circumcircle In geometry, five points determine a conic, so arbitrar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a ''geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geometries ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Polygon
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] |
Hexagon
In geometry, a hexagon (from Ancient Greek, Greek , , meaning "six", and , , meaning "corner, angle") is a six-sided polygon. The total of the internal angles of any simple polygon, simple (non-self-intersecting) hexagon is 720°. Regular hexagon A ''regular polygon, regular hexagon'' has Schläfli symbol and can also be constructed as a Truncation (geometry), truncated equilateral triangle, t, which alternates two types of edges. A regular hexagon is defined as a hexagon that is both equilateral polygon, equilateral and equiangular polygon, equiangular. It is bicentric polygon, bicentric, meaning that it is both cyclic polygon, cyclic (has a circumscribed circle) and tangential polygon, tangential (has an inscribed circle). The common length of the sides equals the radius of the circumscribed circle or circumcircle, which equals \tfrac times the apothem (radius of the inscribed figure, inscribed circle). All internal angles are 120 degree (angle), degrees. A regular hexago ... [...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] |
Triangle
A triangle is a polygon with three Edge (geometry), edges and three Vertex (geometry), 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-Collinearity, collinear, determine a unique triangle and simultaneously, a unique Plane (mathematics), 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmedian Point
In geometry, symmedians are three particular lines associated with every triangle. They are constructed by taking a median of the triangle (a line connecting a vertex with the midpoint of the opposite side), and reflecting the line over the corresponding angle bisector (the line through the same vertex that divides the angle there in half). The angle formed by the symmedian and the angle bisector has the same measure as the angle between the median and the angle bisector, but it is on the other side of the angle bisector. The three symmedians meet at a triangle center called the Lemoine point. Ross Honsberger has called its existence "one of the crown jewels of modern geometry".. Isogonality Many times in geometry, if we take three special lines through the vertices of a triangle, or ''cevians'', then their reflections about the corresponding angle bisectors, called ''isogonal lines'', will also have interesting properties. For instance, if three cevians of a triangle intersect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Five Points Determine A Conic
In Euclidean and projective geometry, just as two (distinct) points determine a line (a degree-1 plane curve), five points determine a conic (a degree-2 plane curve). There are additional subtleties for conics that do not exist for lines, and thus the statement and its proof for conics are both more technical than for lines. Formally, given any five points in the plane in general linear position, meaning no three collinear, there is a unique conic passing through them, which will be non-degenerate; this is true over both the Euclidean plane and any pappian projective plane. Indeed, given any five points there is a conic passing through them, but if three of the points are collinear the conic will be degenerate (reducible, because it contains a line), and may not be unique; see further discussion. Proofs This result can be proven numerous different ways; the dimension counting argument is most direct, and generalizes to higher degree, while other proofs are special to conic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
