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 Robert Sharpley - University of South Carolina
This course is a study of modern geometry as a logical system based upon postulates and undefined terms. Projective geometry, theorems of Desargues and Pappus, transformation theory, affine geometry, Euclidean, non-Euclidean geometries, topology.
(14385 views)
by Zhaohua Luo
This is a book on the general theory of analytic categories. From the table of contents: Introduction; Analytic Categories; Analytic Topologies; Analytic Geometries; Coherent Analytic Categories; Coherent Analytic Geometries; and more.
(14457 views)
by Sigurdur Helgason - Birkhauser Boston
The Radon transform is an important topic in integral geometry which deals with the problem of expressing a function on a manifold in terms of its integrals over certain submanifolds. Solutions to such problems have a wide range of applications.
(14042 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.
(8883 views)