Amazon cover image
Image from Amazon.com

Discrete and computational geometry: the Goodman-Pollack festschrift

Contributor(s): Material type: TextTextSeries: Algorithms and Combinatorics, No. 25Publication details: Berlin Springer-Verlag 2003Description: xii, 853 pISBN:
  • 9783540003717
Subject(s): DDC classification:
  • 513.50285 D4
Summary: 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. https://www.springer.com/gp/book/9783540003717
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Item location Shelving location Call number Status Date due Barcode
Books Vikram Sarabhai Library Rack 28-A / Slot 1369 (0 Floor, East Wing) General Stacks 513.50285 D4 (Browse shelf(Opens below)) Available 155059

With 287 figures

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.

https://www.springer.com/gp/book/9783540003717

There are no comments on this title.

to post a comment.