Search Results for ""
401 - 410 of 2089 for Eulers Polygon Division ProblemSearch Results
A four-sided quadrilateral not contained in a plane. The lines connecting the midpoints of opposite sides of a skew quadrilateral intersect (and bisect) each other (Steinhaus ...
Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...
The regular hexagon is the regular polygon with six sides, as illustrated above. The inradius r, circumradius R, sagitta s, and area A of a regular hexagon can be computed ...
Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...
A generalization of the Euler L-function associated with a Grössencharakter.
The vertex of an isosceles triangle having angle different from the two equal angles is called the apex of the isosceles triangle. The common polygon vertex at the top of a ...
Given a Schwarz triangle (p q r), replacing each polygon vertex with its antipodes gives the three colunar spherical triangles (p q^' r^'),(p^' q r^'),(p^' q^' r), (1) where ...
A mensuration formula is simply a formula for computing the length-related properties of an object (such as area, circumradius, etc., of a polygon) based on other known ...
If, in a plane or spherical convex polygon ABCDEFG, all of whose sides AB, BC, CD, ..., FG (with the exception of AG) have fixed lengths, one simultaneously increases ...
Midpoint augmentation, a term introduced here, is a variant of conventional augmentation in which each facial polygon is replaced by a triangular polygon joining vertices ...
...
View search results from all Wolfram sites (162574 matches)

