• 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
• ISBN-10: 0521848628
• ISBN-13: 978-0521848626
• 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.

• 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.

• Amazon

• Combinatorics and Game Theory
• Computational and Algorithmic Mathematics
• Geometry and Topology
• Mathematical and Computational Software
• Number Theory
• Algebra, Abstract Algebra, and Linear Algebra

• Combinatorial and Computational Geometry (Jacob E. Goodman, et al)

• Combinatorial Geometry with Application to Field Theory

  Topics covered in this book include fundamental of combinatorics, algebraic combinatorics, topology with Smarandache geometry, combinatorial differential geometry, combinatorial Riemannian submanifolds, Lie multi-groups, etc.

• LEDA: A Platform for Combinatorial and Geometric Computing

  LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing. This book, written by the main authors of LEDA, is the definitive account of how the system operates and how it can be used.

• Combinatorics Through Guided Discovery (Kenneth P. Bogart)

  This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'.

• Introduction to Ramsey Theory (Veselin Jungic)

  This book serves as a gentle introduction to Ramsey Theory for readers interested in becoming familiar with a dynamic segment of contemporary mathematics that combines ideas from number theory and combinatorics.

• Applied Combinatorics (Mitchel T. Keller, et al)

  This is a text with more than enough material for a one-semester introduction to combinatorics. The original target audience was primarily computer science majors, but the topics included make it suitable for a variety of different students.

• Analytic Combinatorics (Philippe Flajolet, et al)

  The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications.

• An Introduction to Combinatorics and Graph Theory

  This book walks the reader through the classic parts of Combinatorics and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques.