A complete, self-contained introduction to a powerful and resurgingmathematical discipline . Combinatorial Geometry presents andexplains with complete proofs some of the most important resultsand methods of this relatively young mathematical discipline,started by Minkowski, Fejes Toth, Rogers, and Erd???s. Nearly halfthe results presented in this book were discovered over the pasttwenty years, and most have never before appeared in any monograph.Combinatorial Geometry will be of particular interest tomathematicians, computer scientists, physicists, and materialsscientists interested in computational geometry, robotics, sceneanalysis, and computer-aided design. It is also a superb textbook,complete with end-of-chapter problems and hints to their solutionsthat help students clarify their understanding and test theirmastery of the material. Topics covered include: * Geometric number theory * Packing and covering with congruent convex disks * Extremal graph and hypergraph theory * Distribution of distances among finitely many points * Epsilon-nets and Vapnik--Chervonenkis dimension * Geometric graph theory * Geometric discrepancy theory * And much more

Geometric combinatorics describes a wide area of mathematics that is primarily the study of geometric objects and their combinatorial structure. This text is a compilation of expository articles at the interface between combinatorics and geometry.

Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.

The book is an introduction to the theory of convex polytopes and polyhedral sets, to algebraic geometry, and to the connections between these fields, known as the theory of toric varieties. The first part of the book covers the theory of polytopes and provides large parts of the mathematical background of linear optimization and of the geometrical aspects in computer science. The second part introduces toric varieties in an elementary way.

siehe Werbetext.

Advanced undergraduate-level text discusses theorems on topics restricted to the plane, such as convexity, coverings, and graphs. Two-part treatment begins with specific topics followed by an extensive selection of short proofs. 1964 edition.