Abstract: We present an original approach for the computation of the Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron, without decomposition and union steps-that ...

Abstract: Accurate quantification of uncertainty is a prerequisite for achieving reliable structural design. The convex polyhedron model, which considers correlations between variables, is a ...

The three known classes of convex polyhedron with equal edge lengths and polyhedral symmetry--tetrahedral, octahedral, and icosahedral--are the 5 Platonic polyhedra, the 13 Archimedean ...

The Greeks described two classes of convex equilateral polyhedron with polyhedral symmetry, the Platonic (including the tetrahedron, octahedron, and icosahedron) and the Archimedean (including the ...

Minkowski sums of the convex pieces, and unite the pair-wise sums. While it is desirable to have a decomposition into a minimum number of pieces, this problem is known to be NP-hard ...

Thurston gave a concrete procedure to construct triangulations of the 2-sphere where 5 or 6 triangles meet at each vertex. How can you get the icosahedron using this procedure? Gerard Westendorp has a ...