Search Results for ""

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

A 24-sided polygon. The regular icositetragon is constructible. For side length 1, the inradius r, circumradius R, and area A are given by r = 1/2(2+sqrt(2)+sqrt(3)+sqrt(6)) ...

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...

The mean triangle area of a triangle picked inside a regular hexagon with unit area is A^_=289/3888 (Woolhouse 1867, Pfiefer 1989). This is a special case of a general ...

A rotor is a convex figure that can be rotated inside a polygon (or polyhedron) while always touching every side (or face). The least area rotor in a square is the Reuleaux ...

The regular hendecagon is the regular polygon with 11 sides, as illustrated above, and has Schläfli symbol {11}. The regular hendecagon cannot be constructed using the ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

Given a point P in the interior of a triangle DeltaA_1A_2A_3, draw the cevians through P from each polygon vertex which meet the opposite sides at P_1, P_2, and P_3. Now, ...

A knot equivalent to a polygon in R^3, also called a tame knot. For a polygonal knot K, there exists a plane such that the orthogonal projection pi on it satisfies the ...