Lectures on discrete geometry
This is an introduction to the field of discrete geometry understood as the investigation of combinatorial properties of configurations of (usually finitely many) geometric objects, like arrangements of points or hyperplanes or, more generally, convex sets. Some emphasis is laid on asymptotic results which are relevant for estimating the complexity of geometric algorithms. Certain areas of discrete geometry are neglected intentionally, such as the theory of packing and covering. Besides fundamental facts on convex sets, lattice points, and so on, the book deals with the following themes: combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey theory, polyhedral combinatorics and high-dimensional convexity (including for instance a discussion of volumes in high dimensions and Dvoretzky's theorem on almost spherical sections), embedding of finite metric spaces into normed spaces. All needed concepts and tools are well explained, in particular the more advanced ones like Gale diagrams, Davenport-Schinzel sequences, and Vapnik-Chervonenkis dimension. Even some of the more complicated proofs are given in full detail. At the end of each section a comprehensive survey on historical and recent results is presented. There are also many well-selected exercises, classified according to their difficulty. For some of the exercises hints are given in an appendix. The book is written in a lively and stimulating but very precise style and contains many figures. It gives a good impression of the richness and the relevance of the field. At the end of the book there is a short summary of each chapter.
- Lectures on discrete differential geometry
- Lectures of combinatorial geometry
- scientific article; zbMATH DE number 1013961
- Discrete geometry
- Lectures on geometry
- scientific article; zbMATH DE number 3453507
- Lectures in geometric combinatorics
- Lectures on convex geometry
- scientific article; zbMATH DE number 2012373
- Topological sweep of the complete graph
- Topological obstructions for vertex numbers of Minkowski sums
- Eppstein's bound on intersecting triangles revisited
- On the number of topological types occurring in a parameterized family of arrangements
- On the number of Birch partitions
- Some recollections on early work with Jan Pelant
- Volume distortion for subsets of Euclidean spaces
- On a class of Diophantine equations related to the numbers of cells in hyperplane arrangements
- Small weak epsilon-nets
- Hitting sets when the VC-dimension is small
- Dimension gaps between representability and collapsibility
- A framework for pursuit evasion games in
- On the transversal number and VC-dimension of families of positive homothets of a convex body
- Equipartitioning by a convex 3-fan
- Modular groups in Cantorian \(E^{(\infty)}\) high-energy physics.
- Kleinian groups in \(E^{(\infty)}\) and their connection to particle physics and cosmology.
- On piercing numbers of families satisfying the \((p,q)_{r}\) property
- On the complexity of barrier resilience for fat regions and bounded ply
- Drawing the Horton set in an integer grid of minimum size
- On the union complexity of families of axis-parallel rectangles with a low packing number
- Geometric clustering in normed planes
- Gaussian random projections for Euclidean membership problems
- Analysis of classifiers' robustness to adversarial perturbations
- Vertical perimeter versus horizontal perimeter
- The crossing number of locally twisted cubes \(L T Q_n\)
- Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl
- Entropy of convex functions on \(\mathbb R^d\)
- Only distances are required to reconstruct submanifolds
- On the computation of zone and double zone diagrams
- Point sets with small integer coordinates and no large convex polygons
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- Colorful linear programming, Nash equilibrium, and pivots
- Ramsey numbers and monotone colorings
- Covering lattice points by subspaces and counting point-hyperplane incidences
- The minimal volume of simplices containing a convex body
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Approximating a convex body by a polytope using the epsilon-net theorem
- Lines in Euclidean Ramsey theory
- Fast approximation of betweenness centrality through sampling
- On the number of maximum empty boxes amidst \(n\) points
- The convexification effect of Minkowski summation
- Geometry and discrete mathematics. A selection of highlights
- Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations
- \(N\)-step energy of maps and the fixed-point property of random groups.
- Uniform approximation of Vapnik-Chervonenkis classes
- A center transversal theorem for hyperplanes and applications to graph drawing
- Rigid ball-polyhedra in Euclidean 3-space
- Combinatorial generalizations of Jung's theorem
- Contact graphs of unit sphere packings revisited
- On Grünbaum type inequalities
- Asymptotic estimates for the largest volume ratio of a convex body
- Packing and covering with non-piercing regions
- Computational aspects of the colorful Carathéodory theorem
- Halfspace depth and floating body
- Beta polytopes and Poisson polyhedra: \(f\)-vectors and angles
- Sets of large dimension not containing polynomial configurations
- Quantitative \((p, q)\) theorems in combinatorial geometry
- Reconstruction of atomic measures from their halfspace depth
- Union of hypercubes and 3D Minkowski sums with random sizes
- Radon numbers and the fractional Helly theorem
- Function and colorful extensions of the KKM theorem
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Active-learning a convex body in low dimensions
- The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
- A general incidence bound in \(\mathbb{R}^d\)
- Strong independence and the dimension of a Tverberg set
- Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures
- Random Gale diagrams and neighborly polytopes in high dimensions
- Monte Carlo cubature construction
- A new lower bound on Hadwiger-Debrunner numbers in the plane
- Resilient distributed vector consensus using centerpoint
- Embedding dimension phenomena in intersection complete codes
- Bounded VC-dimension implies the Schur-Erdős conjecture
- Free disposal hull condition to verify when efficiency coincides with weak efficiency
- Exact multi-covering problems with geometric sets
- Some implications of interval approach to dimension for network complexity
- Many order types on integer grids of polynomial size
- Correlations of random classifiers on large data sets
- Geometric and o-minimal Littlewood-Offord problems
- Introduction to the combinatorial atlas
- Learning with cone-based geometric models and orthologics
- Primal and dual combinatorial dimensions
- Arrangements of approaching pseudo-lines
- Computing Shapley values in the plane
- Optimal approximations made easy
- Noisy tensor completion via the sum-of-squares hierarchy
- On the number of edges of separated multigraphs
- Barycentric gluing and geometry of stable metrics
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond
- On the number of hyperedges in the hypergraph of lines and pseudo-discs
- Neural networks with linear threshold activations: structure and algorithms
- The \(\varepsilon\)-\(t\)-net problem
- Tukey depth histograms
- \(k\)-sets and rectilinear crossings in complete uniform hypergraphs
- How to play hot and cold
- Generically globally rigid graphs have generic universally rigid frameworks
- Bracketing numbers of convex and m-monotone functions on polytopes
- Further consequences of the colorful Helly hypothesis
- A crossing lemma for multigraphs
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
This page was built for publication: Lectures on discrete geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530626)
