Search Results for ""
91 - 100 of 486 for Convex HullSearch Results
Alexandrov's theorem addresses conditions under which a polygon will fold into a convex polyhedron (Malkevitch).
A convex set K is centro-symmetric, sometimes also called centrally symmetric, if it has a center p that bisects every chord of K through p.
A pyramid with a heptagonal base. The heptagonal pyramid is one of the 257 convex octahedra.
Of all convex n-gons of a given perimeter, the one which maximizes area is the regular n-gon.
Given a convex plane region with area A and perimeter p, then |N-A|<p, where N is the number of enclosed lattice points.
A polynomial is called unimodal if the sequence of its coefficients is unimodal. If P(x) is log-convex and Q(x) is unimodal, then P(x)Q(x) is unimodal.
Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...
The tangram is a combination of plane polygonal pieces such that the edges of the polygons are coincident. There are 13 convex tangrams (where a "convex tangram" is a set of ...
A graph G is called d-polytopal if there exists a d-dimensional convex polytope P such that the vertices and edges of G are in a one-to-one incidence-preserving ...
The figure formed when the midpoints of the sides of a convex quadrilateral are joined in order is a parallelogram. Equivalently, the bimedians bisect each other. The area of ...
...
View search results from all Wolfram sites (1537 matches)

