**Computational Geometry: Methods and Applications**

by Jianer Chen

1996**Number of pages**: 227

**Description**:

In this book, we concentrate on four major directions in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Computational geometry is of practical importance because Euclidean space of two and three dimensions forms the arena in which real physical objects are arranged. A large number of applications areas such as pattern recognition, computer graphics, image processing, operations research, statistics, computer-aided design, robotics, etc., have been the incubation bed of the discipline since they provide inherently geo metric problems for which efficient algorithms have to be developed. A large number of manufacturing problems involve wire layout, facilities location, cutting-stock and related geometric optimization problems. Solving these efficiently on a high-speed computer requires the development of new geo metrical tools, as well as the application of fast-algorithm techniques, and is not simply a matter of translating well-known theorems into computer programs. From a theoretical standpoint, the complexity of geometric algo rithms is of interest because it sheds new light on the intrinsic difficulty of computation.

Download or read it online for free here:

**Download link**

(1.3MB, PDF)

## Similar books

**Introduction to Design Analysis of Algorithms**

by

**K. Raghava Rao**-

**Smashwords**

This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.

(

**2286**views)

**Algorithms**

by

**Jeff Erickson**-

**University of Illinois at Urbana-Champaign**

These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.

(

**9878**views)

**Data Structures and Algorithms: Annotated Reference with Examples**

by

**Granville Barnett, Luca Del Tongo**-

**DotNetSlackers**

The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.

(

**10699**views)

**Purely Functional Data Structures**

by

**Chris Okasaki**-

**Carnegie Mellon University**

This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.

(

**2478**views)