It was originally written in the French language by Jean-Daniel Boissonnat and Mariette Yvinec, and published as Géometrie algorithmique by Edusciences in 1995.
It was translated into English by Hervé Brönnimann, with improvements to some proofs and additional exercises, and published by the Cambridge University Press in 1998.
[1][2][3] The book covers the theoretical background and analysis of algorithms in computational geometry, their implementation details, and their applications.
[2] The topics presented in these sections and chapters include convex hulls and convex hull algorithms, low-dimensional randomized linear programming, point set triangulation for two- and three-dimensional data, arrangements of hyperplanes, of line segments, and of triangles, Voronoi diagrams, and Delaunay triangulations.
[1] Reviewer Peter McMullen calls it "a welcome addition to the shelves of anyone interested in algorithmic geometry".