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 Derrick Norman Lehmer - Project Gutenberg
The book gives, in a simple way, the essentials of synthetic projective geometry. Enough examples have been provided to give the student a clear grasp of the theory. The student should have a thorough grounding in ordinary elementary geometry.
by E O Harriss - Mathematicians.org.uk
Contents: Background Material (Euclidean Space, Delone Sets, Z-modules and lattices); Tilings of the plane (Periodic, Aperiodic, Penrose Tilings, Substitution Rules and Tiling, Matching Rules); Symbolic and Geometric tilings of the line.
by Michael Frame, Benoit Mandelbrot, Nial Neger - Yale University
This is an introduction to fractal geometry for students without especially strong mathematical preparation, or any particular interest in science. Each of the topics contains examples of fractals in the arts, humanities, or social sciences.