<< 1 >>
Rating: 
Summary: Very comprehensive overview of computational geometry
Review: This book, written by many well-known experts in the field, is a fine compendium of articles on the most active areas of computational geometry. Each article is supplemented with a glossary of terms needed for understanding the relevant concepts and frequently contains a list of open problems. An overview of the convex hull of a collection of random points in Euclidean n-space is given in one of the articles on discrete aspects of stochastic geometry, where also a very interesting discussion of generalizations of the Buffon needle problem is given. There are a few articles overviewing Voronoi diagrams, such as the one on Voronoi diagrams and triangulations. The applications of Voronoi diagrams are many, and include tumour cell diagnosis, biometry, galaxy distributions, and pattern recognition. This article is a little short considering the importance of the subject. The article on shortest paths and networks is somewhat disappointing since there is no in-depth discussion on network routing algorithms. The article on computational topology highlights some of the results in this very important area. Many problems in topology have been tackled recently using computers, particularly the work of the mathematician A.T. Fomenko. Computational topology is a relatively young field, having been in existence only since the early 1990's. The applications are enormous, ranging from meshing, morphing, feature extraction, data compression, and in many scientific areas such as computational medicine, chemistry, and astrophysics. It can also be used in computer security via graphical passwords. It is an immense help in visualizing complicated topological objects, such as Lens spaces, horned spheres, and thickened knots. The article does not touch on the use of Mayer-Vietoris sequences to design efficient divide-and-conquer schemes for computing the homology of higher-dimensional complexes. The interplay between topology and finding better algorithms in computational geometry is one that will flourish no doubt in years to come. The last section of the book covers applications with the most interesting article being the one on sphere packing and coding theory. The algorithms in sphere packing have direct applicability to error correctiong codes over the field GF(q). The author of this article does touch briefly on general algebraic-geometric codes, which is good considering their importance in applications. The last article appropriately discusses available software for computational geometry. Although the list of Web sites is quite extensive, there are many more available since this book was first printed. A very fine addition to the literature on computational geometry and should be on everyone's shelf who is interested in this important area.
<< 1 >>
| 
