Regular polyhedron a hemisphere, and vertices around a great circle. It is "regular" if the vertices are equally spaced. The hosohedron {2,"n"} is dual to the dihedron {"n",2}. Note that when "n" = 2, we obtain the polyhedron {2,2}, which is both a hosohedron and a dihedron. All of these have Euler characteristic 2. Regular polyhedron A regular polyhedron is a polyhedron whose symmetry group acts transitively on its flags. A regular polyhedron is highly symmetrical, being all of edge-transitive, vertex-transitive and face-transitive. In classical contexts, many different equivalent definitions are used; a common one is that faces are congruent regular polygons
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