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

Softcover

ISBN 10: 0521178398 ISBN 13: 9780521178396

Publisher: Cambridge University Press, 2011

Synopsis

During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This volume, which contains 32 papers on a broad range of topics of current interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.

About this title

Book Description

This volume, containing 32 papers on a broad range of topics of current interest in the field, is an outgrowth of the synergism of Discrete and Computational Geometry. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.There are points of contact with many applied areas such as mathematical programming, visibility problems, kinetic data structures, and biochemistry, and with algebraic topology, geometric probability, real algebraic geometry, and combinatorics.

About the Author

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.

Edition details

• Publisher: Cambridge University Press
• Publication date: 2011
• ISBN 10: 0521178398
• ISBN 13: 9780521178396
• Binding: Paperback
• Language: English
• Edition number: 1
• Number of pages: 630
• Editor: Goodman Jacob E., Pach Janos, Welzl Emo