Discrete And Computational Geometry: The Goodman-pollack Festschrift (algorithms And Combinatorics)

0

ISBN 10: 3540003711 / ISBN 13: 9783540003717

Published by Springer, 2003

About this Item

New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Seller Inventory # ABEJUNE24-265479

Bibliographic Details

• Title: Discrete And Computational Geometry: The Goodman-pollack Festschrift (algorithms And Combinatorics)
• Publisher: Springer
• Publication Date: 2003
• Language: English
• ISBN 10: 3540003711
• ISBN 13: 9783540003717
• Binding: Hardcover
• Condition: Brand New

About this title

Synopsis

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.

From the Back Cover

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.