Computational geometry is a rapidly growing young field on the edge of mathematics and computer science. The authors’ research monograph Computational synthetic geometry is a fascinating contribution to this new field. Computational synthetic geometry focusses on algorithmic aspects of certain fundamental realizability problems in discrete geometry and convexity. Typical examples include the construction of polytopes from simplicial complexes, vector geometries from incidence structures, and hyperplane arrangements from oriented matroids. The authors show that algorithms for these constructions exist if and only if arbitrary polynomial equations are decidable over the underlying field. This leads to many new insights on polytopes, projective configurations and combinatorics of Grassmann varieties. Particularly impressive is the discussion of the Steinitz problem for convex polytopes. At the same time the approach involves the study and development of techniques from computational algebraic geometry, convexity and automated theorem proving.
This book is highly recommended to anyone who is interested or working in discrete or computational geometry. It is very likely that it will stimulate further research in this area.