A detailed survey is given of various results pertaining to two well-known problems of
combinatorial geometry: Borsuk's problem on partitions of an arbitrary bounded d …

Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical
computer science will welcome the new edition of this book.”-MAA Reviews Maintaining a …

The second edition of this timely, definitive, and popular book continues to pursue the
question: what is the most efficient way to pack a large number of equal spheres in n …

This monograph sets out a body of mathematical theory for finite graphs with nodes placed
randomly in Euclidean space and edges added to connect points that are close to each …

This is the newly revised and expanded edition of the popular introduction to the design and
implementation of geometry algorithms arising in areas such as computer graphics, robotics …

The History of Degenerate (Bipartite) Extremal Graph Problems Page 1 BOLYAI SOCIETY
Erdos Centennial MATHEMATICAL STUDIES, 25 pp. 169–264. The History of Degenerate (Bipartite) …

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

Convex and Discrete Geometry is an area of mathematics situated between analysis,
geometry and discrete mathematics with numerous relations to other areas. The book gives …

Mixtures of Gaussians are among the most fundamental and widely used statistical models.
Current techniques for learning such mixtures from data are local search heuristics with …

Digital geometry is about deriving geometric information from digital pictures. The field
emerged from its mathematical roots some forty-years ago through work in computer-based …