In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. The presentation is elementary, with no more than high-school mathematics and an interest in geometry required to follow the arguments. Most of the discussion is restricted to two- and three-dimensional Euclidean space, though sometimes more general results and problems are given. Thus even the mathematically unsophisticated reader can grasp some of the results of a branch of twentieth-century mathematics that has applications in such disciplines as mathematical programming, operations research and theoretical computer science. At the end of the book the authors have collected together a set of unsolved and partially solved problems that a sixth-form student should be able to understand and even attempt to solve.36 d d 15/3~-10 d 1 I 46 2 a#39; ~ 2 a#39; ~ 46 a#39; 2 J a#39; we easily find that the length of the segment K1LJ equals: or. substituting in the values of tagt;. c and e we get ^1g903Ad- ^19/? d - 0 9887d This is the maximum of the distances between the vertices of theanbsp;...
|Title||:||Results and Problems in Combinatorial Geometry|
|Author||:||Vladimir G. Boltjansky, Israel Gohberg|
|Publisher||:||CUP Archive - 1985-10-10|