Professor Jiří Matoušek was a distinguished scientist with significant achievements in the areas of discrete and “computational geometry, topology, and some aspects of metric space theory.” His work in discrete and computational geometry provides solutions for simplex and half-space range searching problems and “tools for removing randomization from geometric algorithms.” In addition, Matoušek was an active researcher in the area of geometric discrepancy. He also worked on drawing planar graphs and on “problems in mathematical analysis, graph algorithms, undecidability of combinatorial statements, Euclidean Ramsey theory, generalized convexity, and numerical taxonomy.”
This book is a collection of 32 chapters--surveys and complete high-quality research papers--in the aforementioned areas, written as a tribute to Matoušek. It is oriented to mathematicians and computer scientists, and even advanced business analysts with a strong theoretical background who are interested in the development of algorithms and models. Additionally, the surveys can be useful for graduate students in theoretical computer science and applied mathematics.