It describes SIMD, shared memory, and distributed memory machine models; decomposition as a fundamental activity in parallel algorithmic design; key programming models; key concepts of performance analysis and optimization; and three case studies applying these concepts to the Single Shortest Path Problem, the Eikonal equation, and computation of the two-dimensional

convex hull.

The alpha shapes were initiated by Edelsbrunner, Kirkpatrick and Seidel and derived from the

convex hull, so that each

convex hull is an alpha-shape but not every alpha shape is a

convex hull.

The contribution of this paper is that, comparing the Harris-based

convex hull algorithm, the active contour can extract a more accurate and non-convex foreground.

A convex decomposition of P is a subdivision of the

convex hull of P into convex polygons whose joint vertex set is P; and two convex decompositions of P are related by a simultaneous edge flip if their union contains no crossing edges.

tau]](A) will stand respectively for the closure and closed

convex hull of a subset A [subset or equal to] E* with respect to a locally convex topology [tau] on E*.

The saturated dynamic output feedback controller is expressed by a

convex hull involving the parameter-dependent form of both the actual dynamic output feedback controller and the auxiliary feedback controller, which is different from the saturated output feedback controller in [1, 19, 20].

disturbance attenuation performance of the system under consideration is developed by using the multiple Lyapunov functional method while the saturation behavior is described by the

convex hull.

If x [member of] B(H) is such that the norm closed

convex hull of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] in B(H [cross product] [?

5] showed that if the

convex hull of P contains h vertices, then K(P) contains at least [?

It is based on constructing a

convex hull for a cloud of point; it is the smallest convex volume containing the object and, hence, a hull is a tight bounding volume (Tang et al.

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 {.