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.
(14331 views)
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.
(5556 views)
by Jozsef Sandor - American Research Press
Contents: on Smarandache's Podaire theorem, Diophantine equation, the least common multiple of the first positive integers, limits related to prime numbers, a generalized bisector theorem, values of arithmetical functions and factorials, and more.
(18415 views)
by Robert J. Lang
Origami is the art of folding sheets of paper into interesting and beautiful shapes. In this text the author presents a variety of techniques for origami geometric constructions. The field has surprising connections to other branches of mathematics.
(13643 views)