Discrete and Computational Geometry The Goodman-Pollack Festschrift

Discrete and Computational Geometry: The Goodman-Pollack Festschrift by Boris Aronov, Saugata Basu, János Pach, Micha Sharir
English | PDF | 2003 | 847 Pages | ISBN : 3540003711 | 12.7 MB
This is an impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the `founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, arrangements, geometric graph theory and quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, and the theory of packing, covering, and tiling.

This is an impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the `founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, arrangements, geometric graph theory and quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, and the theory of packing, covering, and tiling.
The book will serve as an invaluable source of reference in this discipline, and an indispensible component of the library of anyone working in the above areas.

[b]Fikper
7a1gu.D.a.C.G.T.G.F.rar.html