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 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.
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 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 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.