TOPICS
Search

Search Results for ""


81 - 90 of 13135 for Computational GeometrySearch Results
Given a regular tetrahedron of unit volume, the mean triangle area of a triangle picked at random inside it is approximately A=0.1811+/-0.0012, and the variance is ...
Maximize the amount of floor space which can be covered with a fixed tile (Hoffman 1998, p. 173).
A box can be packed with a harmonic brick a×ab×abc iff the box has dimensions ap×abq×abcr for some natural numbers p, q, r (i.e., the box is a multiple of the brick).
The (not necessarily regular) tetrahedron of least volume circumscribed around a convex body B with volume V is not known. If B is a parallelepiped, then the smallest-volume ...
Place a point somewhere on a line segment. Now place a second point and number it 2 so that each of the points is in a different half of the line segment. Continue, placing ...
The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...
The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...
The concatenation of two strings a and b is the string ab formed by joining a and b. Thus the concatenation of the strings "book" and "case" is the string "bookcase". The ...
The simplest algebraic language, denoted D. If X is the alphabet {x,x^_}, then D is the set of words u of X which satisfy 1. |u|_x=|u|_(x^_), where |u|_x is the numbers of ...
A lag system, introduced by Wang (1963), is a sort of opposite to a tag system. Lag systems allow dependence on more than just the first element, but remove only the first ...
1 ... 6|7|8|9|10|11|12 ... 1314 Previous Next

...