Regular polytope impossible ("not constructible"). The simplest few regular polygons that are impossible to construct are the "n"-sided polygons with "n" equal to 7, 9, 11, 13, 14, 18, 19, 21... Constructibility in this sense refers only to ideal constructions with ideal tools. Of course reasonably accurate approximations can be constructed by a range of methods; while theoretically possible constructions may be impractical. Euclid's "Elements" gave what amount to ruler-and-compass constructions for the five Platonic solids. (See, for example, Euclid's Elements.) However, the merely practical question of how one might draw a straight line in space, even with a ruler, might lead
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