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

In this paper we consider an aggregation technique introduced by Yıldıran [45] to study the convex hull of regions defined by two quadratic inequalities or by a conic quadratic and a quadratic inequality. Yıldıran [45] shows how to characterize the convex hull of open sets defined by two strict quadratic inequalities using Linear Matrix Inequalities (LMI). We show how this aggregation technique...

The genetic mechanism involved in a transition from the black-colored seed hull of the ancestral wild rice (Oryza rufipogon and Oryza nivara) to the straw-white seed hull of cultivated rice (Oryza sativa) during grain ripening remains unknown. We report that the black hull of O. rufipogon was controlled by the Black hull4 (Bh4) gene, which was fine-mapped to an 8.8-kb region on rice chromosome ...

We combine classical concepts from different disciplines — those of α-hull and α-shape from computational geometry, splitting data into training and test sets from artificial intelligence, density-based spatial clustering from data mining, and moving average from time series analysis — to develop a robust algorithm for reconstructing the shape of a curve from noisy samples. The novelty of our a...

For a connected graph G with at least two vertices and S a subset of vertices, the convex hull [S]G is the smallest convex set containing S. The hull number h(G) is the minimum cardinality among the subsets S of V (G) with [S]G = V (G). Upper bound for the hull number of strong product G⊠H of two graphs G and H is obtainted. Improved upper bounds are obtained for some class of strong product gr...

The problem of finding the digital convex fuzzy hull of a digital fuzzy set, whose support is made of some digital points (centroids) in Z, is considered here. A region is DL−convex if, for any two pixels belonging to it, there exists a digital straight line between them, all of whose pixels belong to the region. An algorithm how to compute the DL−convex hull of a digital region is described. A...

Many algorithms for both identifying and reconstructing a 3-D object are based on the 2-D silhouettes of the object. In general, identifying a nonconvex object using a silhouettebased approach implies neglecting some features of its surface as identification clues. The same features cannot be reconstructed by volume intersection techniques using multiple silhouettes of the object. This paper ad...

The research presented in this thesis is targeted towards obtaining high quality novel views of a dynamic scene using video from multiple wide-baseline views, with free-viewpoint video as the main application goal. The research has led to several novel contributions to the 3D reconstruction computer vision literature. The first novel contribution of this work is the exact view-dependent visual ...