Equilateral polygon Equilateral polygon In geometry, three or more than three straight lines (or segment of a line) make a polygon and an equilateral polygon is a polygon which has all sides of the same length. Except in the triangle case, it need not be equiangular (need not have all angles equal), but if it does then it is a regular polygon. If the number of sides is at least five, an equilateral polygon need not be a convex polygon: it could be concave or even self-intersecting. All regular polygons and isotoxal polygons are equilateral. An equilateral triangle is a regular triangle
Computational geometry main branches of computational geometry are: The primary goal of research in combinatorial computational geometry is to develop efficient algorithms and data structures for solving problems stated in terms of basic geometrical objects: points, line segments, polygons, polyhedra, etc. Some of these problems seem so simple that they were not regarded as problems at all until the advent of computers. Consider, for example, the "Closest pair problem": One could compute the distances between all the pairs of points, of which there are "n(n-1)/2", then pick the pair with the smallest distance. This brute-force algorithm takes O("n") time; i.e. its execution