Logo

Computational Geometry: Methods and Applications

Computational Geometry: Methods and Applications
by


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.

Home page url

Download or read it online for free here:
Download link
(1.3MB, PDF)

Similar books

Book cover: Vector Models for Data-Parallel ComputingVector Models for Data-Parallel Computing
by - The MIT Press
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.
(12206 views)
Book cover: LEDA: A Platform for Combinatorial and Geometric ComputingLEDA: A Platform for Combinatorial and Geometric Computing
by - Cambridge University Press
The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.
(9915 views)
Book cover: Algorithms for Clustering DataAlgorithms for Clustering Data
by - Prentice Hall
The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
(20732 views)
Book cover: Randomized AlgorithmsRandomized Algorithms
by - ESSLLI
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.
(11720 views)