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 Nigel Hitchin
The techniques of projective geometry provide the technical underpinning for perspective drawing and in particular for the modern version of the Renaissance artist, who produces the computer graphics we see every day on the web.
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.
by Maximilian Kreuzer - Technische Universitat Wien
From the table of contents: Topology (Homotopy, Manifolds, Surfaces, Homology, Intersection numbers and the mapping class group); Differentiable manifolds; Riemannian geometry; Vector bundles; Lie algebras and representations; Complex manifolds.
by Keith Ball, Vitali Milman - Cambridge University Press
Convex bodies are at once simple and amazingly rich in structure. This collection involves researchers in classical convex geometry, geometric functional analysis, computational geometry, and related areas of harmonic analysis.