📑 Table of Contents▼
This article is about the book. For the field, see computational geometry.
Algorithmic Geometry
AuthorJean-Daniel Boissonnat and Mariette Yvinec
Original titleGéometrie algorithmique
TranslatorHervé Brönnimann
LanguageFrench
PublisherEdusciences
Publication date1995

Algorithmic Geometry is a textbook on computational geometry. 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]

Topics

edit

The book covers the theoretical background and analysis of algorithms in computational geometry, their implementation details, and their applications.[1] It is grouped into five sections, the first of which covers background material on the design and analysis of algorithms and data structures, including computational complexity theory, and techniques for designing randomized algorithms. Its subsequent sections each consist of a chapter on the mathematics of a subtopic in this area, presented at the level of detail needed to analyze the algorithms, followed by two or three chapters on algorithms for that subtopic.[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.[2][3]

Audience and reception

edit

The book can be used as a graduate textbook, or as a reference for computational geometry research.[1] Reviewer Peter McMullen calls it "a welcome addition to the shelves of anyone interested in algorithmic geometry".[2]

References

edit
  1. ^ a b c Stifter, S., zbMATH, Zbl 0917.68212{{citation}}: CS1 maint: untitled periodical (link)
  2. ^ a b c d McMullen, Peter (November 1999), Bulletin of the London Mathematical Society, 31 (6): 758–759, doi:10.1112/blms/31.6.758{{citation}}: CS1 maint: untitled periodical (link)
  3. ^ a b Hecker, Hans-Dietrich (1999), Mathematical Reviews, MR 1631175{{citation}}: CS1 maint: untitled periodical (link)

📚 Artikel Terkait di Wikipedia

Brigitte Vallée

Vol. 56, No. 194 (Apr., 1991), pp. 823–849. Brigitte Vallée, Algorithmique en géométrie des nombres. Applications à la cryptographie et à la factorisation

CaRMetal

article: [1]) Martin Yves. Algorithmique et intégration des outils. Repères IREM, 79 (2010), p. 5-22. Martin Yves. Géométrie repérée dynamique : une autre

Splitting circle method

maint: postscript (link) Gourdon, Xavier (1996). Combinatoire, Algorithmique et Geometrie des Polynomes. Paris: Ecole Polytechnique. Pan, V. Y. (1996).

Mariette Yvinec

Yvinec is the co-author of two books in computational geometry: Géometrie Algorithmique (with Jean-Daniel Boissonnat, Edusciences 1995), translated as

Stéphane de Gérando

Fragments labyrinthiques, Théâtre du labyrinthe, Macrobiotique point zéro, Algorithmique Grand Cycle) Electroacoustic 1 (7 titles), UPC EAN 198003576506, 2022

Durand–Kerner method

3–4, 1992, pp. 83–105. Gourdon, Xavier (1996). Combinatoire, Algorithmique et Geometrie des Polynomes. Paris: École Polytechnique. Archived from the original