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 ﬁelds as diverse as operations research, molecular biology, and robotics.
Discrete geometry has contributed signiﬁcantly 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 ﬁeld 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.
TABLE OF CONTENTS
part |380 pages
Combinatorial and Discrete Geometry
part |168 pages
Polytopes and Polyhedra
part |135 pages
Combinatorial and Computational Topology
part |318 pages
Algorithms and Complexity of Fundamental Geometric Objects
part |153 pages
Geometric data Structures and Searching
part |132 pages
part |487 pages
Applications of Discrete and Computational Geometry
part |55 pages