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 Wong Yan Loi - National University of Singapore
Contents: A Brief History of Greek Mathematics; Basic Results in Book I of the Elements; Triangles; Quadrilaterals; Concurrence; Collinearity; Circles; Using Coordinates; Inversive Geometry; Models and Basic Results of Hyperbolic Geometry.
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 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.