Incenter centers known to the ancient Greeks, and the only one that does not in general lie on the Euler line. It is the first listed center, X(1), in Clark Kimberling's Encyclopedia of Triangle Centers, and the identity element of the multiplicative group of triangle centers. For polygons with more than three sides, the incenter only exists for tangential polygons—those that have an incircle that is tangent to each side of the polygon. In this case the incenter is the center of this circle and is equally distant from all sides. It is a theorem in Euclidean geometry that the three
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