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 Charles Howard Hinton - S. Sonnenschein & Co.
C. H. Hinton discusses the subject of the higher dimensionality of space, his aim being to avoid mathematical subtleties and technicalities, and thus enable his argument to be followed by readers who are not sufficiently conversant with mathematics.
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 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.