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 Maximilian Kreuzer - Technische Universitat Wien
From the table of contents: Topology (Homotopy, Manifolds, Surfaces, Homology, Intersection numbers and the mapping class group); Differentiable manifolds; Riemannian geometry; Vector bundles; Lie algebras and representations; Complex manifolds.
by Nigel Hitchin
The techniques of projective geometry provide the technical underpinning for perspective drawing and in particular for the modern version of the Renaissance artist, who produces the computer graphics we see every day on the web.
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.
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.