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 O'Connor - University of St Andrews
Contents: Foundations; Linear groups; Isometries of Rn; Isometries of the line; Isometries of the plane; Isometries in 3 dimensions; Symmetry groups in the plane; Platonic solids; Finite symmetry groups of R3; Full finite symmetry groups in R3; etc.
by Anton Petrunin
This book is meant to be rigorous, elementary and minimalist. At the same time it includes about the maximum what students can absorb in one semester. It covers Euclidean geometry, Inversive geometry, Non-Euclidean geometry and Additional topics.
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.
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.