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
Intersection (Euclidean geometry) and an iteration. See "Examples:" If one wants to determine the intersection points of two polygons, one can check the intersection of any pair of line segments of the polygons (see above). For polygons with many segments this method is rather time-consuming. In practice one accelerates the intersection algorithm by using "window tests". In this case one divides the polygons into small sub-polygons and determines the smallest window (rectangle with sides parallel to the coordinate axes) for any sub-polygon. Before starting the time-consuming determination of the intersection point of two line segments any pair of windows is tested for common