Search Results for ""
71 - 80 of 13135 for Computational GeometrySearch Results
![](/common/images/search/spacer.gif)
A face-centered cubic sphere packing obtained by placing layers of spheres one on top of another. Because there are two distinct ways to place each layer on top of the ...
The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.
Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).
Given n circles and a perimeter p, the total area of the convex hull is A_(Convex Hull)=2sqrt(3)(n-1)+p(1-1/2sqrt(3))+pi(sqrt(3)-1). Furthermore, the actual area equals this ...
The mean tetrahedron volume V^_ is the average volume of a tetrahedron in tetrahedron picking within some given shape. As summarized in the following table, it is possible to ...
The boundaries of the cells of a Voronoi diagram.
The fraction eta of a volume filled by a given collection of solids.
Given a regular pentagon of unit area, mean triangle area of a triangle picked at random inside it is given by the n=5 case of polygon triangle picking, A^_ = ...
The breaking up of self-intersecting polygons into simple polygons (illustrated above) is also called tessellation (Woo et al. 1999).
Tetrahedron picking is the process of picking tetrahedra at random within a given shape in 3 or higher dimensions. The most natural definition of a random tetrahedron is one ...
![](/common/images/search/spacer.gif)
...