Discrete and Computational Geometry: The Goodman-Pollack Festschrift

Boris Aronov, Saugata Basu, Janos Pach et Micha Sharir

ISBN 10: 3540003711 / ISBN 13: 9783540003717

Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2003

Riguardo questo articolo

Ancien livre de bibliothèque. Couverture différente. Edition 2003. Tome 25. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Different cover. Edition 2003. Volume 25. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-867-846

Dati bibliografici

Titolo: Discrete and Computational Geometry: The ...

Casa editrice: Springer-Verlag Berlin and Heidelberg GmbH & Co. K

Data di pubblicazione: 2003

Legatura: Hardcover

Condizione: Très bon

Descrizione articolo

Riassunto:

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, study of arrangements, geometric graph theory, quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, the theory of packing, covering, and tiling. The book serves as an invaluable source of reference in this discipline.

Dalla quarta di copertina:

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.