We present a hybrid algorithm to compute the convex hull of points in three or higher dimensional spaces. Our formulation uses a GPU-based interior point filter to cull away many of the points that do not lie on the boundary. The convex hull of remaining points is computed on a CPU. The GPU-based filter proceeds in an incremental manner and computes a pseudo-hull that is contained inside the co...

In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumes pure and mixed integer programs and many other nonconvex programming problems. Two representations are given for the convex hull of feasible points. each of which provides linear programming equivalents of the disjunctive program. The first one involves a number of new ...

LET K C R3 be a simple closed curve, and K be its convex hull. In [l], Almgren and Thurston define the (oriented) convex hull genus of K to be the minimal genus of an (oriented) surface contained in g and bounded by K. They give examples showing that even if K is unknotted both the orientable and non-orientable convex hull genus of K may be arbitrarily large. In 43 of this paper we show that th...

The problem of acquiring procedural knowledge for hull form design and construction of a knowledge base for hull form selection is addressed in this paper. An object oriented methodology involving creating classes, state diagrams and data flows for parametric hull form design was undertaken. An interactive graphical tool for the production of hull designs from a parent design was developed base...

Original scientific paper Since an evident tendency of the shipbuilding is that the sizes of ships are larger and larger, the dynamic interactions between the propulsion system and ship hull in large scale ships are much severer than those of the small sized ships. Ship hull deformations caused by the action of heavy excited wave forces could affect the vibration characteristics of the propulsi...

in this note we characterize polynomial numerical hulls of matrices $a in m_n$ such that$a^2$ is hermitian. also, we consider normal matrices $a in m_n$ whose $k^{th}$ power are semidefinite. for such matriceswe show that $v^k(a)=sigma(a)$.

In this paper, the m-hull sets in the join and composition of two connected graphs are characterized and their m-hull numbers are shown to be direct consequences of these characterizations.

Problem of defining convexity of a digital region is considered. Definition of DL− (digital line) convexity is proposed, and it is shown to be stronger than the other two definitions, T−(triangle) convexity and L−(line) convexity. In attempt to connect the convexity of digital sets, to the fact that digital set can be a fuzzy set, the notion of convexity of the membership function is introduced...

A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distance between a pair of points is the minimum time required to move from one point to the other, with optional use of H. The highway hull H(S,H) of a point set S is the minimal set containing S as well as the shortest pat...