9783540003717-3540003711-Discrete and Computational Geometry: The Goodman-Pollack Festschrift (Algorithms and Combinatorics, 25)

Discrete and Computational Geometry: The Goodman-Pollack Festschrift (Algorithms and Combinatorics, 25)

ISBN-13: 9783540003717
ISBN-10: 3540003711
Edition: 2003
Author: Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir
Publication date: 2003
Publisher: Springer
Format: Hardcover 865 pages
FREE US shipping
Buy

From $47.70

Book details

ISBN-13: 9783540003717
ISBN-10: 3540003711
Edition: 2003
Author: Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir
Publication date: 2003
Publisher: Springer
Format: Hardcover 865 pages

Summary

Discrete and Computational Geometry: The Goodman-Pollack Festschrift (Algorithms and Combinatorics, 25) (ISBN-13: 9783540003717 and ISBN-10: 3540003711), written by authors Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir, was published by Springer in 2003. With an overall rating of 3.6 stars, it's a notable title among other Computer Science (Data Processing, Databases & Big Data, Algorithms, Programming) books. You can easily purchase or rent Discrete and Computational Geometry: The Goodman-Pollack Festschrift (Algorithms and Combinatorics, 25) (Hardcover) from BooksRun, along with many other new and used Computer Science books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.3.

Description

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.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book