Textbook in PDF and DJVU formats

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world―as researchers in mathematics and computer science―and in the professional world―as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.
Combinatorial and Discrete Geometry
Polytopes and Polyhedra
Combinatorial and Computational Topology
Algorithms and Complexity of Fundamental Geometric Objects
Geometric Data Structures and Searching
Computational Techniques
Applications of Discrete and Computational Geometry
Geometric Software