Academic Journals Database
Disseminating quality controlled scientific knowledge

CONVEX HULL PROBLEM, LATTICE POINTS AND APPLICATIONS

ADD TO MY LIST
 
Author(s): DUMITRU FANACHE

Journal: Journal of Science and Arts
ISSN 1844-9581

Volume: 15;
Issue: 2;
Start page: 163;
Date: 2011;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Lattice point | convex hull | algorithm.

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
Affiliate Program     

Tango Jona
Tangokurs Rapperswil-Jona