Search Results for ""
181 - 190 of 772 for Convex PolygonSearch Results
The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...
A principal vertex x_i of a simple polygon P is called an ear if the diagonal [x_(i-1),x_(i+1)] that bridges x_i lies entirely in P. Two ears x_i and x_j are said to overlap ...
The circles on the polygon diagonals of a complete quadrilateral as diameters are coaxal. Furthermore, the orthocenters of the four triangles of a complete quadrilateral are ...
Shephard's conjecture states that every convex polyhedron admits a self-unoverlapping unfolding (Shephard 1975). This question is still unsettled (Malkevitch), though most ...
A 16-sided polygon, sometimes also called a hexakaidecagon. The regular hexadecagon is a constructible polygon, and the inradius r, circumradius R, and area A of the regular ...
The regular decagon is constructible 10-sided regular polygon with Schläfli symbol {10}. The inradius r, circumradius R, and area can be computed directly from the formulas ...
A pyramid is a polyhedron with one face (known as the "base") a polygon and all the other faces triangles meeting at a common polygon vertex (known as the "apex"). A right ...
In the field of functional analysis, the Krein-Milman theorem is a result which characterizes all (nonempty) compact convex subsets K of "sufficiently nice" topological ...
If the trilinear polars of the polygon vertices of a triangle are distinct from the respectively opposite sides, they meet the sides in three collinear points.
A convex body in Euclidean space that is centrally symmetric with center at the origin is determined among all such bodies by its brightness function (the volume of each ...
...
View search results from all Wolfram sites (4549 matches)

