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 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.
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.
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 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.