Processing ......
FreeComputerBooks.com
Links to Free Computer, Mathematics, Technical Books all over the World

Want to know the Wikipedia page of a particular airport? Click here to find out.
 Title Combinatorial and Computational Geometry
 Author(s) Jacob E. Goodman, János Pach, Emo Welzl
 Publisher: Cambridge University Press (August 8, 2005)
 Hardcover 628 pages
 eBook PDF Files
 Language: English
 ISBN10: 0521848628
 ISBN13: 9780521848626
 Share This:
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 Authors 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 cofounder and coeditorinchief of The Journal of Discrete and Computational Geometry. He is also the coeditor 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.