chapter 1 Finite Point Configurations -- chapter 2 Packing and Covering -- chapter 3 Tilings -- chapter 4 Helly-Type Theorems and Geometric Transversals -- chapter 5 Pseudoline Arrangements -- chapter 6 Oriented Matroids -- chapter 7 Lattice Points and Lattice Polytopes -- chapter 8 Low-Distortion Embeddings of Finite Metric Spaces -- chapter 9 Geometry and Topology of Polygonal Linkages -- chapter 10 Geometric Graph Theory -- chapter 11 Euclidean Ramsey Theory -- chapter 12 Discrete Aspects of Stochastic Geometry -- chapter 13 Geometric discrepancy theory and uniform distribution -- chapter 14 Topological Methods -- chapter 15 Polyominoes -- chapter 16 Basic Properties of Convex Polytopes -- chapter 17 Subdivisions and Triangulationsof Polytopes -- chapter 18 Face Numbers of Polytopes and Complexes -- chapter 19 SYMMETRYOF POLYTOPES AND POLYHEDRA -- chapter 20 Polytope Skeletons and Paths -- chapter 21 Polyhedral Maps -- chapter 22 Convex Hull Computations -- chapter 23 Voronoi Diagrams and Delaunay Triangulations -- chapter 24 Arrangements -- chapter 25 Triangulations and Mesh Generation -- chapter 26 Polygons -- chapter 27 Shortest Paths and Networks -- chapter 28 Visibility -- chapter 29 Geometric Reconstruction Problems -- chapter 30 Curve and Surface Reconstruction -- chapter 31 Computational Convexity -- chapter 32 Computational Topology -- chapter 33 Computational Real Algebraic Geometry -- chapter 34 Point Location -- chapter 35 Collision and Proximity Queries -- chapter 36 Range Searching -- chapter 37 Ray Shooting and Lines in Space -- chapter 38 Geometric Intersection -- chapter 39 Nearest Neighbors in High-Dimensional Spaces -- chapter 40 Randomization and derandomization -- chapter 41 Robust geometric computation -- chapter 42 Parallel algorithms in geometry -- chapter 43 Parametric search -- chapter 44 The discrepancy method in computational geometry -- chapter 45 Linear programming -- chapter 46 Mathematical programming -- chapter 47 Algorithmic motion planning -- chapter 48 Robotics -- chapter 49 Computer graphics -- chapter 50 Modeling motion -- chapter 51 Pattern recognition -- chapter 52 Graph drawing -- chapter 53 Splines and geometric modeling -- chapter 54 Surface simplification and 3D geometry compression -- chapter 55 Manufacturing processes -- chapter 56 Solid modeling -- chapter 57 Computation of robust statistics -- chapter 58 Geographic information systems -- chapter 59 Geometric applications of the grassmann-cayley algebra -- chapter 60 Rigidity and scene analysis -- chapter 61 Sphere packing and coding theory -- chapter 62 Crystals and quasicrystals -- chapter 63 Biological applications of computational topology -- chapter 64 Software -- chapter 65 Volume of a d-polytope: FIGURE 16.2.