CONVEX HULL PROBLEM, LATTICE POINTS AND APPLICATIONS
Journal Title: Journal of Science And Arts - Year 2011, Vol 15, Issue 2
Abstract
Problem of finding convex hull is one of the central problems of computational geometry. It appears both applications in economic, financial, environmental, architectural and analytical geometry in specific issues. Latticial point is called (in the plane or in space) at any point whose coordinates are integers. Historically, lattices were investigated since the late 18th century by mathematicians such as Lagrange, Gauss, and later Minkowski. More recently, lattices have become a topic of active research in computer science. They are used an algorithmic tool to solve a wide variety of problems; they have many applications in cryptography and cartography; and they have some unique properties from a computational complexity point of view.
Authors and Affiliations
DUMITRU FANACHE
PATH COALGEBRA kQ AND RIGHT COMODULES OVER kQ
SOME CONSEQUENCES OF DRIMBE INEQUALITY
In this paper we present a refinement of inequality: ∑sinA/2≥5/4+r/2R who are true in any acute triangle ABC and some consequences of DRIMBE inequality.
NONNEGATIVE SOLUTIONS IN TWO POINT BOUNDARY VALUE PROBLEMS
We consider the two point boundary value problem:-u”(x)=λf(u(x)); xЄ(-1,1), u(-1)=0=u(1), where f:[0,∞)->R is a twice differentiable function and λ>0 is a positive parameter. We discuss the cases when f(0)>0(pos...
CHARACTERIZATION OF THE IONIC NITRING IN THE PROCESS APPLICATION ON 12% Cr STEELS FOR TOOLS AND COLD DEFORMATION DEVICES MANUFACTURING
The ionic nitriding found a good application in the treatment of cold deformation devices that, because of the hard work conditions, must stand complex loads and show superior phzsicomechanical properties. For example, t...
INEQUALITIES IN TRIANGLE
In this paper we will demonstrate a new inequality between sine and a function of first degree. Applications of this inequality in triangle are given.