A novel algorithm is presented to compute the convex hull of a point set in R3 using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull, the algorithm derives the approximation of the convex hull from the former. The other extreme vertices of the convex hull are then found by using a two-round checking in the digital and the contin...

We study the convex hull of the splittable flow arc set with capacity and minimum load constraints. This set arises as a relaxation of problems where clients have demand for a resource that can be installed in integer amounts and that has capacity limitations and lower bounds on utilization. We prove that the convex hull of this set is the intersection of the convex hull of the set with a capac...

The hulls of linear and cyclic codes have been extensively studied due to their wide applications. The dimensions and average dimension of the Euclidean hull of linear and cyclic codes have been well-studied. In this paper, the average dimension of the Hermitian hull of constacyclic codes of length n over a finite field Fq2 is determined together with some upper and lower bounds. It turns out t...

Convex hulls are fundamental geometric tools used in a number of algorithms. This paper presents a fast, simple to implement and robust Smart Convex Hull (S-CH) algorithm for computing the convex hull of a set of points in . This algorithm is based on “spherical” space subdivision. The main idea of the S-CH algorithm is to eliminate as many input points as possible before the convex hull constr...

H. KAHAL, A.A. TAHRANI, J.T. GEORGE, I.M. BARLOW and M.A. MALIK University of Hull, Diabetes Research Centre, Brocklehurst Building, Hull Royal Infirmary, Hull, School of Clinical and Experimental Medicine, University of Birmingham, Birmingham, MRC Centre for Reproductive Health, The Queen’s Medical Research Institute, Edinburgh, Department of Clinical Biochemistry and Department of Diabetes an...

We introduce the notion of a projective hull for subsets of complex projective varieties parallel to the idea of a polynomial hull in affine varieties. With this concept, a generalization of J. Wermer’s classical theorem on the hull of a curve in Cn is established in the projective setting. The projective hull is shown to have interesting properties and is related to various extremal functions ...

The practical application of the Computational Fluid Dynamics (CFD), for predicting the flow pattern around Multipurpose Amphibious Vehicle (MAV) hull has made much progress over the last decade. Today, several of the CFD tools play an important role in the land and water going vehicle hull form design. CFD has been used for analysis of MAV hull resistance, seakeeping, maneuvering and investiga...

One useful generalization of the convex hull of a set S of n points is the-strongly convex-hull. It is deened to be a convex polygon P with vertices taken from S such that no point in S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. It was an open question 1 as to whether an-strongly convex O()-hull existed for all positive. W...