Unlike in Overmars and van Leeuwen's approach, we do not actually store a representation of the vertex sequence of the convex hull
. Nevertheless, our data structure contains sufficient information to answer many basic queries on the convex hull
-- The centroid of the convex hull
of a set of vectors in a unitary space is defined and its properties are studied.
If the nodal density varies widely, this union of disks may not cover the convex hull
of the nodes, i.e., the convex hull
could include points (x, y) for which C(x, y) = 0 because (x, y) is not within the radius of influence of any node.
For example, in his sketch of the folk theorem for repeated games, Rubinstein points out that his construction only covers outcomes in the relevant convex hull
with rational weights on the extreme points and tells the reader where to look up the more complicated construction for the other points (with some irrational weights).
The convex-hull algorithms compute the difference between the object and its convex hull
recursively until the difference is a null set.
Shape covered by the minimal convex polygon yields the convex hull
of the shape.
We use color-boosted saliency to detect salient points and compute convex hull
based on the salient points to estimate salient region.
Then for each function F analytic in E, the convolution ([phi] * F[psi])/([phi] * [psi]) takes only values in the convex hull
The method employed to extract the edge points is a convex hull
algorithm shown in Table 1.
Before we establish a convergence theorem, let us recall some basic facts about quasi-nonexpansive mappings and the distance between points in a convex hull
Secondly, a discrete convex hull
method is adopted to solve problems that R-function is inappropriate to represent a geometric object with some curves or surfaces, and there are some pendent points and edges in Boolean operations.