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 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 L. Henkin, P. Suppes, A. Tarski - North Holland Publishing Company
The volume naturally divides into three parts. Part I consists of 14 papers on the foundations of geometry, Part II of 14 papers on the foundations of physics, and Part III of five papers on general problems and applications of the axiomatic method.
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 S. E. Payne - University of Colorado Denver
The present book grew out of notes written for a course by the same name taught by the author during in 2005. Only some basic abstract algebra, linear algebra, and mathematical maturity are the prerequisites for reading this book.