This paper presents a new O(nlog(n)) algorithm for computing the convex hull of a set of 3 dimensional points. The algorithm first sorts the point in (x,y,z) then incrementally adds sorted points to the convex hull using the constraint that each new point added to the hull can 'see' at least one facet touching the last point added. The reduces the search time for adding new points. The algorith...

In the present study, the overall economic impact of hull fouling on a mid-sized naval surface ship (Arleigh Burke-class destroyer DDG-51) has been analyzed. A range of costs associated with hull fouling was examined, including expenditures for fuel, hull coatings, hull coating application and removal, and hull cleaning. The results indicate that the primary cost associated with fouling is due ...

We show that for every integer k ≥ 2 and every k graphs G1, G2, . . . , Gk, there exists a hull graph with k hull vertices v1, v2, . . . , vk such that link L(vi) = Gi for 1 ≤ i ≤ k. Moreover, every pair a, b of integers with 2 ≤ a ≤ b is realizable as the hull number and geodetic number (or upper geodetic number) of a hull graph. We also show that every pair a, b of integers with a ≥ 2 and b ≥...

The high demand for cotton production worldwide has presented a need for its standardized classification. There currently exists trained classers and instrumentation to distinguish key cotton quality parameters, such as some trash types and content. However, it is of interest to develop a universal instrumental method with higher trash identification specificity. A program was implemented to de...

We provide an explicit description of the convex hull of the set of matrices of bounded rank, restricted to balls for the spectral norm. As applications, we deduce two relaxed forms of the rank function restricted to balls for the spectral norm: one is the quasiconvex hull of this rank function, another one is the convex hull of the rank function, thus retrieving Fazel's theorem (2002). Key-wor...

We study the complexity of computing the mixed-integer hull conv(P ∩ Z ×R) of a polyhedron P . Given an inequality description, with one integer variable, the mixed-integer hull can have exponentially many vertices and facets in d. For n, d fixed, we give an algorithm to find the mixed integer hull in polynomial time. Given P = conv(V ) and n fixed, we compute a vertex description of the mixed-...

We propose a hull operator, the reflex-free hull, that allows us to define a 3D analogue to bays in polygons. The reflex-free hull allows a rich set of topological types, yet for polyhedral input with n edges, it remains a polyhedral set with O(n) edges. This is in contrast to other possible hull definitions that give non-planar surfaces and higher combinatorial complexity. The reflex-free hull...

abstract: this study was conducted to investigate the effects of diets containing different levels of hull-less barley on caecal microflora of broiler chicks. two hundred and forty one-day old male broiler chicks (arbor acres strain) were used in a completely randomized design with 4 tratments, and 3 replicates were allocated to each treatment. different levels of hull-less barley in diets had ...