Combinatorial and Computational Geometry
by J. E. Goodman, J. Pach, E. Welzl
Publisher: Cambridge University Press 2007
ISBN/ASIN: 0521848628
ISBN-13: 9780521848626
Number of pages: 616
Description:
This volume 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.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books

by Anton Petrunin
This book is meant to be rigorous, elementary and minimalist. At the same time it includes about the maximum what students can absorb in one semester. It covers Euclidean geometry, Inversive geometry, Non-Euclidean geometry and Additional topics.
(7761 views)

by Andrew Ranicki, et al. - American Mathematical Society
This volume includes papers ranging from applications in topology and geometry to the algebraic theory of quadratic forms. Various aspects of the use of quadratic forms in algebra, analysis, topology, geometry, and number theory are addressed.
(13484 views)

by Robert Sharpley - University of South Carolina
This course is a study of modern geometry as a logical system based upon postulates and undefined terms. Projective geometry, theorems of Desargues and Pappus, transformation theory, affine geometry, Euclidean, non-Euclidean geometries, topology.
(15484 views)

by Keith Ball, Vitali Milman - Cambridge University Press
Convex bodies are at once simple and amazingly rich in structure. This collection involves researchers in classical convex geometry, geometric functional analysis, computational geometry, and related areas of harmonic analysis.
(13694 views)