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 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.
by Robert J. Lang
Origami is the art of folding sheets of paper into interesting and beautiful shapes. In this text the author presents a variety of techniques for origami geometric constructions. The field has surprising connections to other branches of mathematics.
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 Sigurdur Helgason - Birkhauser Boston
The Radon transform is an important topic in integral geometry which deals with the problem of expressing a function on a manifold in terms of its integrals over certain submanifolds. Solutions to such problems have a wide range of applications.