Computational Geometry: Methods and Applications

Geometric objects such as points, lines, and polygons are the basis of a broad variety of important applications and give rise to an interesting set of problems and algorithms. The name geometry reminds us of its earliest use: for the measurement of land and materials.
Today, computers are being used more and more to solve larger-scale geometric problems. Over the past two decades, a set of tools and techniques has been developed that takes advantage of the structure provided by geometry. This discipline is known as Computational Geometry.
This book is an introduction to some of the fundamental principles of computational geometry, concentrates on four major directions in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems.