This is the newly revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design.Expand

We present a number of new geometrical and computational methods and applications.COMBINATORIAL AND DISCRETE GEOMETRY Finite Point Configurations, J.W. Richter-Gebert and G. Schulte Polytope Skeletons and Paths, G. Seidel Voronoi Diagrams and Delaunay Triangulations, S.K. Bjoerner Symmetry of Polytopes and Polyhedra, E.Expand

We present an O(n log k) algorithm for finding a minimal nested polygon nested between two convex polygons that has a minimal number of vertices.Expand

Two sets of planar pointsS1 andS2 are circularly separable if there is a circle that enclosesS1 but excludesS2. We show that deciding whether two sets are circularly separable can be accomplishedâ€¦ Expand