Handbook of Computational Geometry

Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.

Preface. List of contrinbutors. 1. Davenport-Schinzel sequences and their geometric applications (P.K. Agarwal and M. Sharir). 2. Arrangements and their applications (P.K. Agarwal and M. Sharir). 3. Discrete geometric shapes: Matching, interpolation, and approximation (H. Alt and L.J. Guibas). 4. Deterministic parallel computational geometry (M.J. Attalah and D.Z. Chen). 5. Voronoi diagrams (F. Aurenhammer and R. Klein). 6. Mesh generation (M. Bern and P. Plassmann). 7. Applications of computational geometry to geographic information systems (L. de Floriani, P. Magillo and E. Puppo). 8. Making geometry visible: An introduction to the animation of geometric algorithms (A. Hausner and D.P. Dobkin). 9. Spanning trees and spanners (D. Eppstein). 10. Geometric data structures (M.T. Goodrich and K. Ramaiyer). 11. Polygon decomposition (J.M. Keil). 12. Link distance problems (A. Maheshwari, J.-R. Sack and H. N. Djidjev). 13. Derandomization in computational geometry (J. Matoušek). 14. Robustness and precision issues in geometric computation (S. Schirra). 15. Geometric shortest paths and network optimization (J.S.B. Mitchell). 16. Randomizedalgorithms in computaional geometry (K. Mulmuley).