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 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.
(6208 views)
by Alfred North Whitehead - Cambridge University Press
In this book, after the statement of the axioms, the ideas considered are those concerning the association of Projective and Descriptive Geometry by means of ideal points, point to point correspondence, congruence, distance, and metrical geometry.
(9368 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.
(1716 views)
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.
(16677 views)