Combinatorial and Computational Geometry
by J. E. Goodman, J. Pach, E. Welzl
Publisher: Cambridge University Press 2007
Number of pages: 616
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.
Home page url
Download or read it online for free here:
(multiple PDF files)
by Oleg A. Belyaev - Moscow State University
A continually updated book devoted to rigorous axiomatic exposition of the basic concepts of geometry. Self-contained comprehensive treatment with detailed proofs should make this book both accessible and useful to a wide audience of geometry lovers.
by John C. Polking - Rice University
We are interested here in the geometry of an ordinary sphere. In plane geometry we study points, lines, triangles, polygons, etc. On the sphere there are no straight lines. Therefore it is natural to use great circles as replacements for lines.
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.
by Silvio Levy - Cambridge University Press
This book collects accessible lectures on four geometrically flavored fields of mathematics that have experienced great development in recent years: hyperbolic geometry, dynamics in several complex variables, convex geometry, and volume estimation.