Fanache, Dumitru Convex hull problem, lattice points and applications. (English) Zbl 1248.68519 J. Sci. Arts 11, No. 2, 163-175 (2012). Summary: Finding the convex hull is one of the central problems of computational geometry with applications to economics, finance, environmental and architectural studies. A lattice point (in the plane or in space) is any point whose coordinates are integers. More recently, lattices have become a topic of active research in computer science. They are used as 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. MSC: 68U05 Computer graphics; computational geometry (digital and algorithmic aspects) Keywords:lattice point; convex hull; computational geometry PDFBibTeX XMLCite \textit{D. Fanache}, J. Sci. Arts 11, No. 2, 163--175 (2012; Zbl 1248.68519)