Combinatorial and Computational Geometry
by J. E. Goodman, J. Pach, E. Welzl
Publisher: Cambridge University Press 2007
ISBN/ASIN: 0521848628
ISBN-13: 9780521848626
Number of pages: 616
Description:
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.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books
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.
(16162 views)
by L. Henkin, P. Suppes, A. Tarski - North Holland Publishing Company
The volume naturally divides into three parts. Part I consists of 14 papers on the foundations of geometry, Part II of 14 papers on the foundations of physics, and Part III of five papers on general problems and applications of the axiomatic method.
(9955 views)
by Rene De Vogelaere - arXiv
The purpose of this book is to give an exposition of geometry, from a point of view which complements Klein's Erlangen program. The emphasis is on extending the classical Euclidean geometry to the finite case, but it goes beyond that.
(1021 views)
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.
(22143 views)