We introduce the reflexive hull discriminant as a tool to study noncommutative algebras that are finitely generated, but not necessarily free, over their centers. As an example, we compute discriminants for quantum generalized Weyl and use them determine automorphism groups other properties, recovering results of Su{\'a}rez-Alvarez, Vivas, others.

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

A method for the morphing of surface/volume meshes suitable to be used in hydrodynamic shape optimization is proposed. Built OpenFOAM environment, it relies on a Laplace equation that propagates modifications surface boundaries, realized by applying free-form deformation subdivision description geometry, into computational volume mesh initially built through combination BlockMesh with cfMesh. T...

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

A set P = H ∪ {w} of n + 1 points in the plane is called a wheel set if all points but w are extreme. We show that for the purpose of counting crossing-free geometric graphs on P , it suffices to know the so-called frequency vector of P . While there are roughly 2 distinct order types that correspond to wheel sets, the number of frequency vectors is only about 2n/2. We give simple formulas in t...

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