Ad
related to: polygon definition triangle geometry
Search results
Results from the WOW.Com Content Network
A triangle is a polygon with three corners and three sides, one of the basic shapes in geometry.The corners, also called vertices, are zero-dimensional points while the sides connecting them, also called edges, are one-dimensional line segments.
Some polygons of different kinds: open (excluding its boundary), boundary only (excluding interior), closed (including both boundary and interior), and self-intersecting. In geometry, a polygon (/ ˈ p ɒ l ɪ ɡ ɒ n /) is a plane figure made up of line segments connected to form a closed polygonal chain.
Individual polygons are named (and sometimes classified) according to the number of sides, combining a Greek-derived numerical prefix with the suffix -gon, e.g. pentagon, dodecagon. The triangle, quadrilateral and nonagon are exceptions, although the regular forms trigon, tetragon, and enneagon are sometimes encountered as well.
In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length). Regular polygons may be either convex or star .
An equilateral triangle is a triangle in which all three sides have the same length, and all three angles are equal. Because of these properties, the equilateral triangle is a regular polygon, occasionally known as the regular triangle. It is the special case of an isosceles triangle by modern definition, creating more special properties.
Polygon triangulations may be found in linear time and form the basis of several important geometric algorithms, including a simple approximate solution to the art gallery problem. The constrained Delaunay triangulation is an adaptation of the Delaunay triangulation from point sets to polygons or, more generally, to planar straight-line graphs.
Not every polygon with more than three sides is an inscribed polygon of a circle; those polygons that are so inscribed are called cyclic polygons. Every triangle can be inscribed in an ellipse, called its Steiner circumellipse or simply its Steiner ellipse, whose center is the triangle's centroid .
In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, [1] i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is P. Triangulations may be viewed as special cases of planar straight-line graphs.
Ad
related to: polygon definition triangle geometry