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 Oleg A. Belyaev - Moscow State University
A continually updated book devoted to rigorous axiomatic exposition of the basic concepts of geometry. Self-contained comprehensive treatment with detailed proofs should make this book both accessible and useful to a wide audience of geometry lovers.
by Conway, Doyle, Thurston - Rutgers University, Newark
These are notes from an experimental mathematics course entitled Geometry and the Imagination as developed by Conway, Doyle, Thurston and others. The course aims to convey the richness, diversity, connectedness, depth and pleasure of mathematics.
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 Jozsef Sandor - American Research Press
Contents: on Smarandache's Podaire theorem, Diophantine equation, the least common multiple of the first positive integers, limits related to prime numbers, a generalized bisector theorem, values of arithmetical functions and factorials, and more.