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 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 Christopher Pope - Texas A&M University
Lecture notes on Geometry and Group Theory. In this course, we develop the basic notions of Manifolds and Geometry, with applications in physics, and also we develop the basic notions of the theory of Lie Groups, and their applications in physics.
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.
by Andrew Ranicki, et al. - American Mathematical Society
This volume includes papers ranging from applications in topology and geometry to the algebraic theory of quadratic forms. Various aspects of the use of quadratic forms in algebra, analysis, topology, geometry, and number theory are addressed.