Search Results for ""

The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

An incircle is an inscribed circle of a polygon, i.e., a circle that is tangent to each of the polygon's sides. The center I of the incircle is called the incenter, and the ...

65537 is the largest known Fermat prime, and the 65537-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. The 65537-gon has so many ...

The adjective "affine" indicates everything that is related to the geometry of affine spaces. A coordinate system for the n-dimensional affine space R^n is determined by any ...

An Archimedean spiral is a spiral with polar equation r=atheta^(1/n), (1) where r is the radial distance, theta is the polar angle, and n is a constant which determines how ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

The contact triangle of a triangle DeltaABC, also called the intouch triangle, is the triangle DeltaC_AC_BC_C formed by the points of tangency of the incircle of DeltaABC ...

Let the circles c_2 and c_3^' used in the construction of the Brocard points which are tangent to A_2A_3 at A_2 and A_3, respectively, meet again at D_A. The points D_AD_BD_C ...

The term Euclidean refers to everything that can historically or logically be referred to Euclid's monumental treatise The Thirteen Books of the Elements, written around the ...