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 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.
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 Alfred North Whitehead - Cambridge University Press
In this book, after the statement of the axioms, the ideas considered are those concerning the association of Projective and Descriptive Geometry by means of ideal points, point to point correspondence, congruence, distance, and metrical geometry.
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.