Combinatorial and Computational Geometry (Mathematical Sciences Research Institute Publications, Series Number 52)

ISBN 10: 0521848628 / ISBN 13: 9780521848626

Edité par Cambridge University Press, 2005

A propos de cet article

volume 52 No dust jacket. Good hardcover with some shelfwear; may have previous owner's name inside. Standard-sized. N° de réf. du vendeur mon0000283578

Détails bibliographiques

Titre : Combinatorial and Computational Geometry (...

Éditeur : Cambridge University Press

Date d'édition : 2005

Reliure : hardcover

Etat : Good

A propos de ce titre

Synopsis :

This 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.

À propos de l?auteur:

Jacob E. Goodman is a professor of Mathematics at City College, CUNY, and the author of a number of papers in Geometry. He is the co-founder and co-editor-in-chief of The Journal of Discrete and Computational Geometry. He is also the co-editor of many other leading books in the field, most notably, The Handbook of Discrete and Computational Geometry, published by CRC Press, whose second edition has just appeared, and several volumes published by the American Mathematical Society. A past winner of the MAA's Lester R. Ford award, Goodman was also the founder and first president of the New York Composers Circle. He is a member of the American Mathematical Society. Janos Pach is a distinguished professor of Computer Science at City College, New York, Senior Research Fellow at the Mathematical Institute of the Hungarian Academy of Sciences, and Research Professor at New York University. His main fields of interest are Discrete and Computational Geometry, Convexity and Combinatorics. He has written more than 180 research papers. His book, Combinatorial Geometry (with Pankaj Agarwal) was published by Wiley in 1995. He serves on the editorial boards of seven professional journals. For his scientific achievements, he received the Grunwald medal from The Janos Bolyai Mathematical Society (1982), The Lester R. Ford award from The Mathematical Association of America (1990), The Renyi Prize, and the Academy Award from the Hungarian Academy of Sciences (1993, 1998). Emo Welzl is a full professor of Computer Science at the Institute for Theoretical Computer Science of Eth Zurich. His research interests are in the Foundations of Computer Science, mainly Algorithms and Data Structures, in particular, Computational Geometry and Applications, Analysis of Geometric Structures, Randomized Methods, and Discrete Gometry. He was awarded the Max Planck Prize in 1992 and the Gottfried Wilhelm Leibniz Prize in 1995. He has been an ACM Fellow since 1998.