In both of them technology is defined in the form of

convex hull of different periods' technologies, but one question is posed here: whether any convex combination of DMUs in different periods has a real existence?

If T is normal, then F(T) = Co{[sigma](T)}, where Co{*} denotes the

convex hull of {.

The Newton polytope of a Laurent polynomial is the

convex hull of all the exponent vectors of the monomials, i.

i] = [+ or -] 1} denotes the

convex hull, obtained by varying the reflection coefficient [k.

For 1, the

convex hull is computed with an implementation of the QuickHull algorithm (de Berg et al, 2008), which is an exact computation.

Having simulated the process we can easily see that if the PRI is inside the

convex hull of the contact surface of the object, then the process is performed stably; in this example [d.

Here, we demonstrate an alternative approach where a minimum

convex hull is derived mathematically from the point cloud generated by laser-scanning mounted skeletons.

In static gait planning problems, biped robot is stable if the projection of COM falls within the

convex hull of the foot support polygon.

and if, in addition, the

convex hull of an idempotent and bounded set of A is bounded (in particular, A is a locally convex algebra with continuous multiplication), then

Then, for F analytic in E with F(0) = 1, [PSI] * Fg/[PSI] * g is contained in the

convex hull of F (E).

Since the micro structural unit of the epidermal pad is polygonal

convex hull or concave pit, it's possible to design and imitate.

Convex hull is a central problem in various applications of computational geometry, such as Vornoi diagrams constructing, triangulation computing, etc.