Search Results for ""
341 - 350 of 2089 for Eulers Polygon Division ProblemSearch Results
Define A^' to be the point (other than the polygon vertex A) where the triangle median through A meets the circumcircle of ABC, and define B^' and C^' similarly. Then the ...
A quadrilateral, sometimes also known as a tetragon or quadrangle (Johnson 1929, p. 61) is a four-sided polygon. If not explicitly stated, all four polygon vertices are ...
An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...
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 ...
A hendecagon is an 11-sided polygon, also variously known as an undecagon or unidecagon. The term "hendecagon" is preferable to the other two since it uses the Greek prefix ...
A heptagon is a seven-sided polygon. It is also sometimes called a septagon, though this usage mixes a Latin prefix sept- (derived from septua-, meaning "seven") with the ...
A 32-sided polygon. The regular icosidodecagon is a constructible polygon, and the regular icosidodecahedron of side length 1 has inradius r, circumradius R, and area A r = ...
The radius of a polygon's incircle or of a polyhedron's insphere, denoted r or sometimes rho (Johnson 1929). A polygon possessing an incircle is same to be inscriptable or ...
The Greek problems of antiquity were a set of geometric problems whose solution was sought using only compass and straightedge: 1. circle squaring. 2. cube duplication. 3. ...
A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...
...
View search results from all Wolfram sites (162574 matches)

