Discrete and Computational Geometry

Boris Aronov

ISBN 10: 3642624421 / ISBN 13: 9783642624421

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2012, 2012

Riguardo questo articolo

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 884 pp. Englisch. Codice articolo 9783642624421

Dati bibliografici

Titolo: Discrete and Computational Geometry

Casa editrice: Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2012

Data di pubblicazione: 2012

Legatura: Taschenbuch

Condizione: Neu

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.